/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_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:18:59,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:18:59,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:18:59,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:18:59,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:18:59,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:18:59,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:18:59,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:18:59,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:18:59,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:18:59,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:18:59,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:18:59,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:18:59,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:18:59,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:18:59,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:18:59,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:18:59,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:18:59,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:18:59,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:18:59,459 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:18:59,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:18:59,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:18:59,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:18:59,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:18:59,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:18:59,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:18:59,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:18:59,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:18:59,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:18:59,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:18:59,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:18:59,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:18:59,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:18:59,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:18:59,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:18:59,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:18:59,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:18:59,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:18:59,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:18:59,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:18:59,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:18:59,483 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:18:59,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:18:59,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:18:59,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:18:59,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:18:59,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:18:59,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:18:59,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:18:59,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:18:59,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:18:59,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:18:59,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:18:59,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:18:59,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:18:59,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:18:59,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:18:59,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:59,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:18:59,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:18:59,495 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:18:59,495 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:18:59,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:18:59,495 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:18:59,496 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:18:59,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:18:59,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:18:59,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:18:59,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:18:59,728 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:18:59,729 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_1-1.i [2022-04-15 12:18:59,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3b6fc5b/d3ca2a6f93b743a697ee06c88cd8974d/FLAG24f098582 [2022-04-15 12:19:00,189 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:19:00,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-15 12:19:00,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3b6fc5b/d3ca2a6f93b743a697ee06c88cd8974d/FLAG24f098582 [2022-04-15 12:19:00,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3b6fc5b/d3ca2a6f93b743a697ee06c88cd8974d [2022-04-15 12:19:00,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:19:00,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:19:00,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:19:00,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:19:00,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:19:00,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa70300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00, skipping insertion in model container [2022-04-15 12:19:00,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:19:00,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:19:00,856 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_1-1.i[834,847] [2022-04-15 12:19:00,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:19:00,894 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:19:00,915 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_1-1.i[834,847] [2022-04-15 12:19:00,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:19:00,946 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:19:00,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00 WrapperNode [2022-04-15 12:19:00,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:19:00,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:19:00,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:19:00,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:19:00,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:00,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:19:00,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:19:00,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:19:00,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:19:01,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (1/1) ... [2022-04-15 12:19:01,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:19:01,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:01,032 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:19:01,055 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:19:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:19:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:19:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:19:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:19:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:19:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:19:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:19:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:19:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:19:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:19:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:19:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:19:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:19:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:19:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:19:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:19:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:19:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:19:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:19:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:19:01,162 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:19:01,163 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:19:01,353 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:19:01,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:19:01,359 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:19:01,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:19:01 BoogieIcfgContainer [2022-04-15 12:19:01,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:19:01,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:19:01,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:19:01,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:19:01,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:19:00" (1/3) ... [2022-04-15 12:19:01,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57388ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:19:01, skipping insertion in model container [2022-04-15 12:19:01,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:19:00" (2/3) ... [2022-04-15 12:19:01,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57388ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:19:01, skipping insertion in model container [2022-04-15 12:19:01,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:19:01" (3/3) ... [2022-04-15 12:19:01,382 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.i [2022-04-15 12:19:01,387 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:19:01,387 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:19:01,425 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:19:01,435 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:19:01,435 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:19:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:19:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:19:01,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:01,464 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:01,465 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:01,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:01,473 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 1 times [2022-04-15 12:19:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:01,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [607901043] [2022-04-15 12:19:01,495 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:19:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 2 times [2022-04-15 12:19:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:01,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784936042] [2022-04-15 12:19:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:01,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:01,699 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(31, 2); {30#true} is VALID [2022-04-15 12:19:01,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 12:19:01,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-15 12:19:01,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:01,702 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(31, 2); {30#true} is VALID [2022-04-15 12:19:01,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-15 12:19:01,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-15 12:19:01,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-15 12:19:01,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {30#true} is VALID [2022-04-15 12:19:01,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-04-15 12:19:01,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} ~index~0 := 0; {31#false} is VALID [2022-04-15 12:19:01,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !!(~index~0 % 4294967296 < 1000); {31#false} is VALID [2022-04-15 12:19:01,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {31#false} is VALID [2022-04-15 12:19:01,705 INFO L272 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {31#false} is VALID [2022-04-15 12:19:01,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-15 12:19:01,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-15 12:19:01,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-15 12:19:01,706 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:19:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:01,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784936042] [2022-04-15 12:19:01,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784936042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:01,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:01,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:19:01,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:01,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [607901043] [2022-04-15 12:19:01,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [607901043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:01,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:01,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:19:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132973645] [2022-04-15 12:19:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:01,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:19:01,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:01,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:19:01,739 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:19:01,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:19:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:01,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:19:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:19:01,761 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:19:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:01,898 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-15 12:19:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:19:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:19:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:19:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 12:19:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:19:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 12:19:01,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-15 12:19:01,979 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:19:01,987 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:19:01,987 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:19:01,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:19:01,993 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:01,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:19:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:19:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:19:02,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:02,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,031 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,032 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,036 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-15 12:19:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 12:19:02,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:02,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:02,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 12:19:02,037 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 12:19:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,041 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-15 12:19:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 12:19:02,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:02,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:02,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:02,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-15 12:19:02,046 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-15 12:19:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:02,047 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-15 12:19:02,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:19:02,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-15 12:19:02,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 12:19:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:19:02,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:02,088 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:02,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:19:02,088 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 1 times [2022-04-15 12:19:02,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:02,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293760615] [2022-04-15 12:19:02,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:19:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 2 times [2022-04-15 12:19:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:02,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80393532] [2022-04-15 12:19:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:02,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:02,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {218#true} is VALID [2022-04-15 12:19:02,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-15 12:19:02,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-15 12:19:02,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:02,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {218#true} is VALID [2022-04-15 12:19:02,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-15 12:19:02,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-15 12:19:02,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret5 := main(); {218#true} is VALID [2022-04-15 12:19:02,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {223#(= main_~index~0 0)} is VALID [2022-04-15 12:19:02,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-15 12:19:02,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#false} ~index~0 := 0; {219#false} is VALID [2022-04-15 12:19:02,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#false} assume !!(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-15 12:19:02,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {219#false} is VALID [2022-04-15 12:19:02,188 INFO L272 TraceCheckUtils]: 10: Hoare triple {219#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {219#false} is VALID [2022-04-15 12:19:02,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#false} ~cond := #in~cond; {219#false} is VALID [2022-04-15 12:19:02,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {219#false} assume 0 == ~cond; {219#false} is VALID [2022-04-15 12:19:02,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-15 12:19:02,189 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:19:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:02,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80393532] [2022-04-15 12:19:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80393532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:02,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:02,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:19:02,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293760615] [2022-04-15 12:19:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293760615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:02,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:02,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:19:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962327525] [2022-04-15 12:19:02,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:02,192 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:19:02,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:02,193 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:19:02,206 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:19:02,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:19:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:02,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:19:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:19:02,208 INFO L87 Difference]: Start difference. First operand 22 states and 25 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:19:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,325 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-15 12:19:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:19:02,326 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:19:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:02,326 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:19:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 12:19:02,330 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:19:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 12:19:02,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-15 12:19:02,383 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:19:02,384 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:19:02,385 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:19:02,385 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:19:02,386 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:02,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:19:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:19:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-15 12:19:02,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:02,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,394 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,394 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,397 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 12:19:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 12:19:02,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:02,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:02,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 12:19:02,399 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 12:19:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:02,401 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 12:19:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 12:19:02,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:02,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:02,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:02,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 12:19:02,405 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-15 12:19:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:02,405 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 12:19:02,405 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:19:02,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 12:19:02,436 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:19:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 12:19:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:19:02,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:02,437 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:02,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:19:02,438 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 1 times [2022-04-15 12:19:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:02,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128135140] [2022-04-15 12:19:02,448 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:02,449 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 2 times [2022-04-15 12:19:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:02,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442999071] [2022-04-15 12:19:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:02,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {423#true} is VALID [2022-04-15 12:19:02,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:19:02,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:19:02,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:02,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {423#true} is VALID [2022-04-15 12:19:02,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:19:02,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:19:02,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-15 12:19:02,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {428#(= main_~index~0 0)} is VALID [2022-04-15 12:19:02,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {428#(= main_~index~0 0)} is VALID [2022-04-15 12:19:02,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {429#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:19:02,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {424#false} is VALID [2022-04-15 12:19:02,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#false} ~index~0 := 0; {424#false} is VALID [2022-04-15 12:19:02,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#false} assume !!(~index~0 % 4294967296 < 1000); {424#false} is VALID [2022-04-15 12:19:02,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {424#false} is VALID [2022-04-15 12:19:02,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {424#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {424#false} is VALID [2022-04-15 12:19:02,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-15 12:19:02,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-15 12:19:02,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 12:19:02,549 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:19:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:02,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442999071] [2022-04-15 12:19:02,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442999071] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:02,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468759524] [2022-04-15 12:19:02,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:02,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:02,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:02,563 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:19:02,604 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:19:02,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:02,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:02,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:19:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:02,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:02,732 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:19:02,871 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 15 treesize of output 7 [2022-04-15 12:19:02,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-15 12:19:02,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {423#true} is VALID [2022-04-15 12:19:02,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:19:02,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:19:02,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-15 12:19:02,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {428#(= main_~index~0 0)} is VALID [2022-04-15 12:19:02,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:02,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:02,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:02,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 12:19:02,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 1000); {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-15 12:19:02,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {469#(= |main_#t~mem3| 0)} is VALID [2022-04-15 12:19:02,948 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {473#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:02,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {477#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:02,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-15 12:19:02,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 12:19:02,949 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:19:02,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:03,207 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 20 treesize of output 18 [2022-04-15 12:19:03,224 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:19:03,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-15 12:19:03,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-15 12:19:03,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {477#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:03,317 INFO L272 TraceCheckUtils]: 12: Hoare triple {493#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {473#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:03,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {493#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-15 12:19:03,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume !!(~index~0 % 4294967296 < 1000); {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-15 12:19:03,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-15 12:19:03,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:03,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:03,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(= (* (mod main_~index~0 4294967296) 4) 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:03,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {514#(= (* (mod main_~index~0 4294967296) 4) 0)} is VALID [2022-04-15 12:19:03,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-15 12:19:03,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-15 12:19:03,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-15 12:19:03,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {423#true} is VALID [2022-04-15 12:19:03,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-15 12:19:03,486 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:19:03,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468759524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:03,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:03,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2022-04-15 12:19:03,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:03,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128135140] [2022-04-15 12:19:03,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128135140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:03,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:03,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:19:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116747584] [2022-04-15 12:19:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:03,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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:19:03,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:03,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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:19:03,506 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:19:03,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:19:03,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:03,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:19:03,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:19:03,508 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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:19:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:03,747 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-15 12:19:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:19:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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:19:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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:19:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 12:19:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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:19:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 12:19:03,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-15 12:19:03,811 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:19:03,813 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:19:03,813 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:19:03,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:19:03,814 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:03,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:19:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:19:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-04-15 12:19:03,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:03,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:03,830 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:03,831 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:03,833 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-15 12:19:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-15 12:19:03,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:03,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:03,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-15 12:19:03,834 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-15 12:19:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:03,836 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-15 12:19:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-15 12:19:03,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:03,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:03,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:03,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:19:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 12:19:03,839 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 16 [2022-04-15 12:19:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:03,839 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 12:19:03,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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:19:03,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 12:19:03,872 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:19:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 12:19:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:19:03,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:03,873 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:03,901 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:19:04,097 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:19:04,098 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 3 times [2022-04-15 12:19:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708116142] [2022-04-15 12:19:04,106 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:04,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 4 times [2022-04-15 12:19:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:04,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545983659] [2022-04-15 12:19:04,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:04,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {769#true} is VALID [2022-04-15 12:19:04,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-15 12:19:04,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-15 12:19:04,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:04,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {769#true} is VALID [2022-04-15 12:19:04,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-15 12:19:04,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-15 12:19:04,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-15 12:19:04,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {774#(= main_~index~0 0)} is VALID [2022-04-15 12:19:04,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {774#(= main_~index~0 0)} is VALID [2022-04-15 12:19:04,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:04,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:04,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {776#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:19:04,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-15 12:19:04,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-15 12:19:04,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-15 12:19:04,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-15 12:19:04,203 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-15 12:19:04,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-15 12:19:04,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-15 12:19:04,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-15 12:19:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:04,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:04,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545983659] [2022-04-15 12:19:04,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545983659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:04,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902448935] [2022-04-15 12:19:04,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:04,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:04,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:04,206 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:19:04,233 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:19:04,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:04,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:04,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:19:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:04,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:04,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-15 12:19:04,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {769#true} is VALID [2022-04-15 12:19:04,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-15 12:19:04,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-15 12:19:04,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-15 12:19:04,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {774#(= main_~index~0 0)} is VALID [2022-04-15 12:19:04,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {774#(= main_~index~0 0)} is VALID [2022-04-15 12:19:04,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:04,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:04,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {808#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:19:04,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {808#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-15 12:19:04,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-15 12:19:04,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-15 12:19:04,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-15 12:19:04,795 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-15 12:19:04,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-15 12:19:04,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-15 12:19:04,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-15 12:19:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:04,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:04,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-15 12:19:04,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-15 12:19:04,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-15 12:19:04,948 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-15 12:19:04,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-15 12:19:04,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-15 12:19:04,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-15 12:19:04,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {854#(< (mod main_~index~0 4294967296) 1000)} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-15 12:19:04,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {854#(< (mod main_~index~0 4294967296) 1000)} is VALID [2022-04-15 12:19:04,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} is VALID [2022-04-15 12:19:04,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} is VALID [2022-04-15 12:19:04,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} is VALID [2022-04-15 12:19:04,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} is VALID [2022-04-15 12:19:04,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-15 12:19:04,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-15 12:19:04,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-15 12:19:04,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {769#true} is VALID [2022-04-15 12:19:04,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-15 12:19:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:04,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902448935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:04,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:04,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 12:19:04,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:04,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708116142] [2022-04-15 12:19:04,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708116142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:04,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:04,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:19:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991184158] [2022-04-15 12:19:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:04,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:19:04,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:04,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:04,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:04,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:19:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:19:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:19:04,973 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:05,544 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-15 12:19:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:19:05,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:19:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-15 12:19:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-15 12:19:05,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-15 12:19:05,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:05,691 INFO L225 Difference]: With dead ends: 59 [2022-04-15 12:19:05,691 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:19:05,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:19:05,692 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:05,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:19:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:19:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-04-15 12:19:05,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:05,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:19:05,743 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:19:05,744 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:19:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:05,750 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-15 12:19:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-15 12:19:05,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:05,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-04-15 12:19:05,755 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-04-15 12:19:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:05,759 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-15 12:19:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-15 12:19:05,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:05,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:05,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:05,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:19:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 12:19:05,764 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2022-04-15 12:19:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:05,764 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 12:19:05,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:05,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 12:19:05,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 12:19:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:19:05,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:05,824 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:05,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 12:19:06,039 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:19:06,040 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:06,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 5 times [2022-04-15 12:19:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:06,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209515497] [2022-04-15 12:19:06,045 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:06,045 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 6 times [2022-04-15 12:19:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561640345] [2022-04-15 12:19:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:06,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:06,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:06,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {1176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1167#true} is VALID [2022-04-15 12:19:06,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-15 12:19:06,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-15 12:19:06,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:06,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1167#true} is VALID [2022-04-15 12:19:06,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-15 12:19:06,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-15 12:19:06,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-15 12:19:06,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1172#(= main_~index~0 0)} is VALID [2022-04-15 12:19:06,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {1172#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1172#(= main_~index~0 0)} is VALID [2022-04-15 12:19:06,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:06,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:06,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:19:06,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:19:06,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1175#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:19:06,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {1175#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {1168#false} is VALID [2022-04-15 12:19:06,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {1168#false} ~index~0 := 0; {1168#false} is VALID [2022-04-15 12:19:06,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#false} assume !!(~index~0 % 4294967296 < 1000); {1168#false} is VALID [2022-04-15 12:19:06,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1168#false} is VALID [2022-04-15 12:19:06,264 INFO L272 TraceCheckUtils]: 16: Hoare triple {1168#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1168#false} is VALID [2022-04-15 12:19:06,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#false} ~cond := #in~cond; {1168#false} is VALID [2022-04-15 12:19:06,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1168#false} assume 0 == ~cond; {1168#false} is VALID [2022-04-15 12:19:06,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-15 12:19:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:06,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:06,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561640345] [2022-04-15 12:19:06,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561640345] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:06,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037198709] [2022-04-15 12:19:06,266 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:06,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:06,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:06,268 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:19:06,283 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:19:06,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:19:06,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:06,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:19:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:06,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:06,475 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:19:06,565 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-15 12:19:06,565 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 37 treesize of output 36 [2022-04-15 12:19:06,683 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:19:06,684 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:19:06,771 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 15 treesize of output 7 [2022-04-15 12:19:07,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-15 12:19:07,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1167#true} is VALID [2022-04-15 12:19:07,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-15 12:19:07,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-15 12:19:07,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-15 12:19:07,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1172#(= main_~index~0 0)} is VALID [2022-04-15 12:19:07,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1172#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:07,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:19:07,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:19:07,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1209#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:19:07,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:07,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:07,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:07,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:07,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:07,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1229#(= |main_#t~mem3| 0)} is VALID [2022-04-15 12:19:07,034 INFO L272 TraceCheckUtils]: 16: Hoare triple {1229#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:07,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:07,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1168#false} is VALID [2022-04-15 12:19:07,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-15 12:19:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:07,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:08,190 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 42 treesize of output 40 [2022-04-15 12:19:08,225 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 220 treesize of output 218 [2022-04-15 12:19:08,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-15 12:19:08,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1168#false} is VALID [2022-04-15 12:19:08,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:08,470 INFO L272 TraceCheckUtils]: 16: Hoare triple {1253#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:08,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1253#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-15 12:19:08,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume !!(~index~0 % 4294967296 < 1000); {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-15 12:19:08,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-15 12:19:08,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:08,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:08,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {1274#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:08,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {1278#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1274#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:08,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {1282#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= 0 (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_45) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1278#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:08,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1286#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_45) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1282#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= 0 (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_45) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296)))} is VALID [2022-04-15 12:19:08,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#(forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1286#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_45) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:08,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1290#(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:19:08,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-15 12:19:08,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-15 12:19:08,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-15 12:19:08,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1167#true} is VALID [2022-04-15 12:19:08,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-15 12:19:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:08,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037198709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:08,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:08,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 12] total 22 [2022-04-15 12:19:08,498 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209515497] [2022-04-15 12:19:08,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209515497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:08,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:08,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:19:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409096470] [2022-04-15 12:19:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:19:08,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:08,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:08,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:08,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:19:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:19:08,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:19:08,520 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:09,174 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-15 12:19:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:19:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:19:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-15 12:19:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-15 12:19:09,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-15 12:19:09,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:09,279 INFO L225 Difference]: With dead ends: 73 [2022-04-15 12:19:09,279 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 12:19:09,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:19:09,280 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:09,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:19:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 12:19:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2022-04-15 12:19:09,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:09,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:19:09,337 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:19:09,338 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:19:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:09,346 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-15 12:19:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-15 12:19:09,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:09,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:09,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-15 12:19:09,348 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-15 12:19:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:09,353 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-15 12:19:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-15 12:19:09,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:09,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:09,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:09,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:19:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-15 12:19:09,356 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2022-04-15 12:19:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:09,356 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-15 12:19:09,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:09,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-15 12:19:09,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-15 12:19:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:19:09,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:09,402 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:09,419 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:19:09,603 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:19:09,604 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:09,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 7 times [2022-04-15 12:19:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:09,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283346815] [2022-04-15 12:19:09,612 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:09,613 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 8 times [2022-04-15 12:19:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219388979] [2022-04-15 12:19:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:09,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {1661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1651#true} is VALID [2022-04-15 12:19:09,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-15 12:19:09,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-15 12:19:09,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:09,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1651#true} is VALID [2022-04-15 12:19:09,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-15 12:19:09,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-15 12:19:09,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-15 12:19:09,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1656#(= main_~index~0 0)} is VALID [2022-04-15 12:19:09,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1656#(= main_~index~0 0)} is VALID [2022-04-15 12:19:09,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:09,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:09,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:19:09,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:19:09,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 12:19:09,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 12:19:09,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1660#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-15 12:19:09,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 1000); {1652#false} is VALID [2022-04-15 12:19:09,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#false} ~index~0 := 0; {1652#false} is VALID [2022-04-15 12:19:09,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#false} assume !!(~index~0 % 4294967296 < 1000); {1652#false} is VALID [2022-04-15 12:19:09,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1652#false} is VALID [2022-04-15 12:19:09,886 INFO L272 TraceCheckUtils]: 18: Hoare triple {1652#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1652#false} is VALID [2022-04-15 12:19:09,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {1652#false} ~cond := #in~cond; {1652#false} is VALID [2022-04-15 12:19:09,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {1652#false} assume 0 == ~cond; {1652#false} is VALID [2022-04-15 12:19:09,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-15 12:19:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:09,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219388979] [2022-04-15 12:19:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219388979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:09,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033216415] [2022-04-15 12:19:09,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:09,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:09,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:09,904 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:19:09,921 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:19:09,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:09,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:09,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:19:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:10,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:10,028 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:19:10,102 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-15 12:19:10,103 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 37 treesize of output 36 [2022-04-15 12:19:10,147 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-15 12:19:10,148 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 25 treesize of output 24 [2022-04-15 12:19:10,193 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:19:10,194 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:19:10,263 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 15 treesize of output 7 [2022-04-15 12:19:10,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1651#true} is VALID [2022-04-15 12:19:10,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1651#true} is VALID [2022-04-15 12:19:10,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-15 12:19:10,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-15 12:19:10,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-15 12:19:10,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1656#(= main_~index~0 0)} is VALID [2022-04-15 12:19:10,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:10,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:19:10,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:19:10,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:19:10,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:19:10,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1701#(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:19:10,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:10,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:10,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:10,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:10,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:10,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1721#(= |main_#t~mem3| 0)} is VALID [2022-04-15 12:19:10,328 INFO L272 TraceCheckUtils]: 18: Hoare triple {1721#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:10,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:10,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1652#false} is VALID [2022-04-15 12:19:10,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-15 12:19:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:10,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:11,598 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 53 treesize of output 51 [2022-04-15 12:19:11,640 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 3830 treesize of output 3814 [2022-04-15 12:19:21,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-15 12:19:21,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1652#false} is VALID [2022-04-15 12:19:21,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:21,246 INFO L272 TraceCheckUtils]: 18: Hoare triple {1745#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:21,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {1749#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1745#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-15 12:19:21,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {1753#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {1749#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-15 12:19:21,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1753#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-15 12:19:21,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:21,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:21,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {1767#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:19:21,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1771#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1767#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:21,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {1775#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1771#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:21,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1779#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1775#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:21,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1779#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:21,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_72) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_74) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1783#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:21,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {1791#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1787#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_72) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_74) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:19:21,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1791#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-15 12:19:21,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-15 12:19:21,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-15 12:19:21,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-15 12:19:21,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {1651#true} is VALID [2022-04-15 12:19:21,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1651#true} is VALID [2022-04-15 12:19:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:21,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033216415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:21,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:21,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 15] total 27 [2022-04-15 12:19:21,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:21,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283346815] [2022-04-15 12:19:21,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283346815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:21,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:21,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:19:21,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678353585] [2022-04-15 12:19:21,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:19:21,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:21,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:21,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:21,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:19:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:19:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:19:21,326 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:21,922 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-04-15 12:19:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:19:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:19:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-15 12:19:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-15 12:19:21,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2022-04-15 12:19:22,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:22,017 INFO L225 Difference]: With dead ends: 85 [2022-04-15 12:19:22,017 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:19:22,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:19:22,018 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:22,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 43 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:19:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:19:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-04-15 12:19:22,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:22,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:19:22,083 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:19:22,083 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:19:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:22,085 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-15 12:19:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-15 12:19:22,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:22,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:22,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-15 12:19:22,086 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-15 12:19:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:22,089 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-15 12:19:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-15 12:19:22,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:22,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:22,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:22,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:19:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-15 12:19:22,091 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2022-04-15 12:19:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:22,091 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-15 12:19:22,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:22,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 54 transitions. [2022-04-15 12:19:22,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-15 12:19:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:19:22,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:22,166 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:22,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 12:19:22,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:22,390 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 9 times [2022-04-15 12:19:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:22,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1719179488] [2022-04-15 12:19:22,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:19:22,394 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:19:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 10 times [2022-04-15 12:19:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:22,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792331581] [2022-04-15 12:19:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:22,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {2217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {2206#true} is VALID [2022-04-15 12:19:22,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-15 12:19:22,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-15 12:19:22,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:22,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {2217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {2206#true} is VALID [2022-04-15 12:19:22,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-15 12:19:22,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-15 12:19:22,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-15 12:19:22,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2211#(= main_~index~0 0)} is VALID [2022-04-15 12:19:22,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {2211#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2211#(= main_~index~0 0)} is VALID [2022-04-15 12:19:22,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {2211#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:22,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:19:22,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:19:22,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:19:22,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 12:19:22,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 12:19:22,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-15 12:19:22,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-15 12:19:22,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2216#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} is VALID [2022-04-15 12:19:22,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {2216#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} assume !(~index~0 % 4294967296 < 1000); {2207#false} is VALID [2022-04-15 12:19:22,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {2207#false} ~index~0 := 0; {2207#false} is VALID [2022-04-15 12:19:22,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {2207#false} assume !!(~index~0 % 4294967296 < 1000); {2207#false} is VALID [2022-04-15 12:19:22,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {2207#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2207#false} is VALID [2022-04-15 12:19:22,613 INFO L272 TraceCheckUtils]: 20: Hoare triple {2207#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2207#false} is VALID [2022-04-15 12:19:22,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {2207#false} ~cond := #in~cond; {2207#false} is VALID [2022-04-15 12:19:22,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {2207#false} assume 0 == ~cond; {2207#false} is VALID [2022-04-15 12:19:22,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-15 12:19:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:22,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:22,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792331581] [2022-04-15 12:19:22,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792331581] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:22,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117865971] [2022-04-15 12:19:22,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:22,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:22,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:22,616 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:19:22,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:19:22,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:22,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:22,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:19:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:22,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:22,755 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:19:22,844 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-15 12:19:22,844 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 37 treesize of output 36 [2022-04-15 12:19:22,910 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-15 12:19:22,911 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 25 treesize of output 24 [2022-04-15 12:19:22,960 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-15 12:19:22,961 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 25 treesize of output 24 [2022-04-15 12:19:23,021 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:19:23,022 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:19:23,121 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 15 treesize of output 7 [2022-04-15 12:19:23,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2022-04-15 12:19:23,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {2206#true} is VALID [2022-04-15 12:19:23,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-15 12:19:23,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-15 12:19:23,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-15 12:19:23,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2211#(= main_~index~0 0)} is VALID [2022-04-15 12:19:23,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {2211#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:23,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:19:23,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-15 12:19:23,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:19:23,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:19:23,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-15 12:19:23,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-15 12:19:23,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2264#(and (= 3 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:19:23,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {2264#(and (= 3 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:23,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:23,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:19:23,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:23,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:19:23,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2284#(= |main_#t~mem3| 0)} is VALID [2022-04-15 12:19:23,197 INFO L272 TraceCheckUtils]: 20: Hoare triple {2284#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:23,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2292#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:23,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {2292#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2207#false} is VALID [2022-04-15 12:19:23,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-15 12:19:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:23,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:25,429 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 64 treesize of output 62 [2022-04-15 12:19:25,487 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 15622 treesize of output 15590 [2022-04-15 12:20:59,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-15 12:20:59,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {2292#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2207#false} is VALID [2022-04-15 12:20:59,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2292#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:59,031 INFO L272 TraceCheckUtils]: 20: Hoare triple {2308#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:59,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {2312#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2308#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-15 12:20:59,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {2316#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {2312#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-15 12:20:59,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {2316#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-15 12:20:59,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:20:59,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:20:59,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {2330#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-15 12:20:59,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2330#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {2338#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_108) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2334#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2338#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_108) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {2346#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_106) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2342#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {2350#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2346#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_106) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_104) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2350#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {2358#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_104) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_106) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ main_~index~0 4) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2354#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_104) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {2362#(= (* (mod main_~index~0 4294967296) 4) 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2358#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_104) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_106) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ main_~index~0 4) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-15 12:20:59,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2362#(= (* (mod main_~index~0 4294967296) 4) 0)} is VALID [2022-04-15 12:20:59,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-15 12:20:59,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-15 12:20:59,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-15 12:20:59,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {2206#true} is VALID [2022-04-15 12:20:59,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2022-04-15 12:20:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:59,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117865971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:59,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:59,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 17] total 31 [2022-04-15 12:20:59,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:59,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1719179488] [2022-04-15 12:20:59,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1719179488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:59,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:59,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:20:59,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944989497] [2022-04-15 12:20:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:59,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:20:59,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:59,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:59,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:59,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:20:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:20:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:20:59,091 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:59,765 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-04-15 12:20:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:20:59,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:20:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 12:20:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 12:20:59,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 12:20:59,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:59,862 INFO L225 Difference]: With dead ends: 97 [2022-04-15 12:20:59,862 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 12:20:59,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:20:59,865 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:59,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 30 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:20:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 12:20:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-15 12:20:59,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:59,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:20:59,966 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:20:59,966 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:20:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:59,968 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-15 12:20:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-15 12:20:59,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:59,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:59,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-15 12:20:59,969 INFO L87 Difference]: Start difference. First operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-15 12:20:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:59,971 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-15 12:20:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-15 12:20:59,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:59,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:59,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:59,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:20:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-04-15 12:20:59,974 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 24 [2022-04-15 12:20:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:59,974 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-04-15 12:20:59,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:59,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 62 transitions. [2022-04-15 12:21:00,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-15 12:21:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:21:00,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:00,037 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:00,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:21:00,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:00,239 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash -477139086, now seen corresponding path program 11 times [2022-04-15 12:21:00,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:00,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623866414] [2022-04-15 12:21:00,242 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:21:00,242 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:21:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash -477139086, now seen corresponding path program 12 times [2022-04-15 12:21:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:00,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327550280] [2022-04-15 12:21:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:00,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:00,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {2843#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {2831#true} is VALID [2022-04-15 12:21:00,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {2831#true} assume true; {2831#true} is VALID [2022-04-15 12:21:00,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2831#true} {2831#true} #67#return; {2831#true} is VALID [2022-04-15 12:21:00,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {2831#true} call ULTIMATE.init(); {2843#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:00,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {2831#true} is VALID [2022-04-15 12:21:00,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {2831#true} assume true; {2831#true} is VALID [2022-04-15 12:21:00,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2831#true} {2831#true} #67#return; {2831#true} is VALID [2022-04-15 12:21:00,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {2831#true} call #t~ret5 := main(); {2831#true} is VALID [2022-04-15 12:21:00,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {2831#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2836#(= main_~index~0 0)} is VALID [2022-04-15 12:21:00,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {2836#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2836#(= main_~index~0 0)} is VALID [2022-04-15 12:21:00,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {2836#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:21:00,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-15 12:21:00,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:21:00,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-15 12:21:00,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 12:21:00,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-15 12:21:00,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-15 12:21:00,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-15 12:21:00,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-15 12:21:00,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-15 12:21:00,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2842#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:21:00,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {2842#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {2832#false} is VALID [2022-04-15 12:21:00,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {2832#false} ~index~0 := 0; {2832#false} is VALID [2022-04-15 12:21:00,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {2832#false} assume !!(~index~0 % 4294967296 < 1000); {2832#false} is VALID [2022-04-15 12:21:00,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {2832#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2832#false} is VALID [2022-04-15 12:21:00,390 INFO L272 TraceCheckUtils]: 22: Hoare triple {2832#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2832#false} is VALID [2022-04-15 12:21:00,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {2832#false} ~cond := #in~cond; {2832#false} is VALID [2022-04-15 12:21:00,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {2832#false} assume 0 == ~cond; {2832#false} is VALID [2022-04-15 12:21:00,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {2832#false} assume !false; {2832#false} is VALID [2022-04-15 12:21:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:00,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327550280] [2022-04-15 12:21:00,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327550280] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:00,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401867569] [2022-04-15 12:21:00,391 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:21:00,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:00,393 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:21:00,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:21:00,560 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:21:00,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:00,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:21:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:00,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:00,599 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:21:00,645 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-15 12:21:00,645 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 25 treesize of output 24 [2022-04-15 12:21:00,686 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-15 12:21:00,686 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 25 treesize of output 24 [2022-04-15 12:21:00,725 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-15 12:21:00,725 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 25 treesize of output 24 [2022-04-15 12:21:00,771 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-15 12:21:00,771 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:21:00,803 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-04-15 12:21:00,803 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 25 treesize of output 32 [2022-04-15 12:21:00,980 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 15 treesize of output 7 [2022-04-15 12:21:01,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {2831#true} call ULTIMATE.init(); {2831#true} is VALID [2022-04-15 12:21:01,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {2831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {2831#true} is VALID [2022-04-15 12:21:01,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {2831#true} assume true; {2831#true} is VALID [2022-04-15 12:21:01,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2831#true} {2831#true} #67#return; {2831#true} is VALID [2022-04-15 12:21:01,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {2831#true} call #t~ret5 := main(); {2831#true} is VALID [2022-04-15 12:21:01,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {2831#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2836#(= main_~index~0 0)} is VALID [2022-04-15 12:21:01,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {2836#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:21:01,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-15 12:21:01,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-15 12:21:01,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:21:01,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:21:01,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2883#(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:21:01,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2883#(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:21:01,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2890#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:21:01,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {2890#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:21:01,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:21:01,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2901#(or (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-15 12:21:01,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {2901#(or (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2905#(or (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-15 12:21:01,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(or (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !(~index~0 % 4294967296 < 1000); {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-15 12:21:01,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:21:01,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-15 12:21:01,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2918#(= |main_#t~mem3| 0)} is VALID [2022-04-15 12:21:01,046 INFO L272 TraceCheckUtils]: 22: Hoare triple {2918#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:01,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {2922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:21:01,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {2926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2832#false} is VALID [2022-04-15 12:21:01,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {2832#false} assume !false; {2832#false} is VALID [2022-04-15 12:21:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:01,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:02,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_main_~index~0_36 Int) (v_ArrVal_149 Int)) (or (< aux_mod_main_~index~0_36 1000) (<= 4294967296 aux_mod_main_~index~0_36) (= (mod (select (store (select |c_#memory_int| |c_main_~#array~0.base|) (+ |c_main_~#array~0.offset| (* (mod (+ 4294967295 aux_mod_main_~index~0_36) 4294967296) 4)) v_ArrVal_149) |c_main_~#array~0.offset|) 4294967296) 0))) is different from false [2022-04-15 12:21:48,644 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 75 treesize of output 73 [2022-04-15 12:21:49,133 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 245990 treesize of output 245734