/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-properties/simple-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:55:01,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:55:01,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 20:55:01,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:55:01,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:55:02,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:55:02,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:55:02,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:55:02,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:55:02,011 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:55:02,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:55:02,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:55:02,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:55:02,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:55:02,013 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:55:02,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:55:02,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:55:02,014 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:55:02,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:55:02,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:55:02,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:55:02,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:55:02,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:55:02,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:55:02,016 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:55:02,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:55:02,016 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:55:02,016 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:55:02,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:55:02,016 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:55:02,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:55:02,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:55:02,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:55:02,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:55:02,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:55:02,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:55:02,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:55:02,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:55:02,018 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:55:02,018 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:55:02,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:55:02,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:55:02,019 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:55:02,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:55:02,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:55:02,019 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:55:02,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-24 20:55:02,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:55:02,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:55:02,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:55:02,242 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:55:02,242 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:55:02,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple-2.i [2023-12-24 20:55:03,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:55:03,439 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:55:03,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple-2.i [2023-12-24 20:55:03,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5bb567b/c3809a2ab7604ae7bb7e2d9518005184/FLAG45b48a71b [2023-12-24 20:55:03,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5bb567b/c3809a2ab7604ae7bb7e2d9518005184 [2023-12-24 20:55:03,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:55:03,469 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:55:03,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:55:03,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:55:03,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:55:03,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a218821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03, skipping insertion in model container [2023-12-24 20:55:03,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,508 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:55:03,731 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple-2.i[23225,23238] [2023-12-24 20:55:03,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:55:03,752 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:55:03,788 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple-2.i[23225,23238] [2023-12-24 20:55:03,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:55:03,816 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:55:03,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03 WrapperNode [2023-12-24 20:55:03,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:55:03,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:55:03,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:55:03,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:55:03,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,861 INFO L138 Inliner]: procedures = 127, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-12-24 20:55:03,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:55:03,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:55:03,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:55:03,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:55:03,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,904 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-12-24 20:55:03,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:55:03,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:55:03,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:55:03,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:55:03,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (1/1) ... [2023-12-24 20:55:03,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:55:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:55:03,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 20:55:03,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 20:55:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-24 20:55:04,008 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 20:55:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 20:55:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:55:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:55:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:55:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:55:04,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:55:04,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:55:04,085 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:55:04,086 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:55:04,119 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-24 20:55:04,196 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:55:04,228 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:55:04,228 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 20:55:04,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:55:04 BoogieIcfgContainer [2023-12-24 20:55:04,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:55:04,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:55:04,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:55:04,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:55:04,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:55:03" (1/3) ... [2023-12-24 20:55:04,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c8fe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:55:04, skipping insertion in model container [2023-12-24 20:55:04,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:03" (2/3) ... [2023-12-24 20:55:04,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c8fe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:55:04, skipping insertion in model container [2023-12-24 20:55:04,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:55:04" (3/3) ... [2023-12-24 20:55:04,234 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-12-24 20:55:04,249 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:55:04,250 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:55:04,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:55:04,293 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21685179, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:55:04,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:55:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 20:55:04,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:04,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:04,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:04,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1597896168, now seen corresponding path program 1 times [2023-12-24 20:55:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834326704] [2023-12-24 20:55:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:04,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:04,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:04,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 20:55:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:04,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:55:04,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:04,423 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:55:04,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834326704] [2023-12-24 20:55:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834326704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:55:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:55:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:55:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969796368] [2023-12-24 20:55:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:55:04,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:55:04,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:55:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:55:04,446 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:04,460 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-24 20:55:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:55:04,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-24 20:55:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:04,465 INFO L225 Difference]: With dead ends: 27 [2023-12-24 20:55:04,465 INFO L226 Difference]: Without dead ends: 13 [2023-12-24 20:55:04,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:55:04,469 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:04,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 20:55:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-24 20:55:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-24 20:55:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-24 20:55:04,493 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-12-24 20:55:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:04,494 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-24 20:55:04,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-24 20:55:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 20:55:04,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:04,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:04,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 20:55:04,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:04,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:04,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1847503380, now seen corresponding path program 1 times [2023-12-24 20:55:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430993720] [2023-12-24 20:55:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:04,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:04,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 20:55:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:04,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 20:55:04,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:04,865 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 7 [2023-12-24 20:55:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:04,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:55:04,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430993720] [2023-12-24 20:55:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430993720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:55:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:55:04,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 20:55:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021430832] [2023-12-24 20:55:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:55:04,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:55:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:04,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:55:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:55:04,902 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:05,009 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-12-24 20:55:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 20:55:05,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 20:55:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:05,010 INFO L225 Difference]: With dead ends: 28 [2023-12-24 20:55:05,011 INFO L226 Difference]: Without dead ends: 26 [2023-12-24 20:55:05,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:55:05,012 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:05,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:55:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-24 20:55:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2023-12-24 20:55:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-24 20:55:05,015 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2023-12-24 20:55:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:05,015 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-24 20:55:05,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-24 20:55:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 20:55:05,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:05,016 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:05,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 20:55:05,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:05,217 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:05,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1027892324, now seen corresponding path program 1 times [2023-12-24 20:55:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375047608] [2023-12-24 20:55:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:05,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:05,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:05,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 20:55:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:05,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 20:55:05,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:05,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 20:55:05,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 20:55:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:05,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:05,442 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 21 [2023-12-24 20:55:05,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:55:05,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:55:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:05,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375047608] [2023-12-24 20:55:05,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375047608] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:05,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:05,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-12-24 20:55:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371238044] [2023-12-24 20:55:05,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:05,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:55:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:05,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:55:05,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:55:05,468 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:05,554 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-24 20:55:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:55:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-24 20:55:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:05,555 INFO L225 Difference]: With dead ends: 32 [2023-12-24 20:55:05,555 INFO L226 Difference]: Without dead ends: 22 [2023-12-24 20:55:05,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:55:05,556 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:05,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:55:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-24 20:55:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2023-12-24 20:55:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-24 20:55:05,560 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2023-12-24 20:55:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:05,561 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-24 20:55:05,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-24 20:55:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 20:55:05,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:05,561 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:05,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 20:55:05,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:05,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:05,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1651422971, now seen corresponding path program 1 times [2023-12-24 20:55:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388592578] [2023-12-24 20:55:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:05,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:05,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:05,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:05,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 20:55:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:05,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 20:55:05,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:05,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 20:55:05,919 INFO L378 Elim1Store]: Elim1 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 [2023-12-24 20:55:05,936 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:55:05,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:55:05,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-24 20:55:06,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:55:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:06,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:06,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2023-12-24 20:55:06,084 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_75 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_75 .cse0))) v_ArrVal_75)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-12-24 20:55:06,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:06,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 134 [2023-12-24 20:55:06,137 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-12-24 20:55:06,166 INFO L378 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-12-24 20:55:06,173 INFO L378 Elim1Store]: Elim1 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 48 treesize of output 46 [2023-12-24 20:55:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 20:55:06,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388592578] [2023-12-24 20:55:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388592578] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:06,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-24 20:55:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093213470] [2023-12-24 20:55:06,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:06,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:55:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:06,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:55:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2023-12-24 20:55:06,230 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:06,461 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-24 20:55:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 20:55:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-24 20:55:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:06,462 INFO L225 Difference]: With dead ends: 32 [2023-12-24 20:55:06,462 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 20:55:06,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=153, Unknown=2, NotChecked=54, Total=272 [2023-12-24 20:55:06,463 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:06,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 41 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2023-12-24 20:55:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 20:55:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2023-12-24 20:55:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-12-24 20:55:06,467 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2023-12-24 20:55:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:06,467 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-12-24 20:55:06,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-12-24 20:55:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-24 20:55:06,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:06,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:06,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 20:55:06,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:06,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:06,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1303834283, now seen corresponding path program 1 times [2023-12-24 20:55:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040646453] [2023-12-24 20:55:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:06,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:06,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:06,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 20:55:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:06,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 20:55:06,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:06,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 20:55:06,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:55:06,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:55:06,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 20:55:06,892 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-24 20:55:06,893 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 100 [2023-12-24 20:55:06,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 19 [2023-12-24 20:55:06,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2023-12-24 20:55:06,937 INFO L378 Elim1Store]: Elim1 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 39 treesize of output 21 [2023-12-24 20:55:06,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-24 20:55:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:06,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:06,998 INFO L378 Elim1Store]: Elim1 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 452 treesize of output 408 [2023-12-24 20:55:07,018 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (or (forall ((v_ArrVal_107 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_ArrVal_112 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (forall ((v_ArrVal_107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_107) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2023-12-24 20:55:07,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:07,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2023-12-24 20:55:07,067 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 22 [2023-12-24 20:55:07,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:07,086 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-24 20:55:07,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:07,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-12-24 20:55:07,102 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 18 [2023-12-24 20:55:07,112 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:55:07,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:55:07,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 20:55:07,120 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:55:07,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-24 20:55:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 20:55:07,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:07,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040646453] [2023-12-24 20:55:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040646453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:07,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:07,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-12-24 20:55:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141912607] [2023-12-24 20:55:07,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:07,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:55:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:07,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:55:07,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2023-12-24 20:55:07,188 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:11,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:55:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:11,517 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-12-24 20:55:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 20:55:11,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-24 20:55:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:11,518 INFO L225 Difference]: With dead ends: 35 [2023-12-24 20:55:11,518 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 20:55:11,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=214, Unknown=1, NotChecked=30, Total=306 [2023-12-24 20:55:11,519 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:11,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 46 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 1 Unknown, 32 Unchecked, 4.2s Time] [2023-12-24 20:55:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 20:55:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-24 20:55:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-24 20:55:11,522 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2023-12-24 20:55:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:11,523 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-24 20:55:11,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-24 20:55:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 20:55:11,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:11,523 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:11,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 20:55:11,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:11,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:11,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1687156834, now seen corresponding path program 2 times [2023-12-24 20:55:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514646337] [2023-12-24 20:55:11,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:55:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:11,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:11,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 20:55:11,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:55:11,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:11,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 20:55:11,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:11,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 20:55:11,865 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-24 20:55:11,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-12-24 20:55:11,876 INFO L378 Elim1Store]: Elim1 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 [2023-12-24 20:55:11,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-24 20:55:11,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:55:11,947 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:55:11,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:55:11,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:55:11,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:55:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:12,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:16,677 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_19| (_ BitVec 32))) (or (not (= v_ArrVal_160 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_160 .cse0))))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_160) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_162) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_164) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|))))) is different from false [2023-12-24 20:55:16,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:16,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 134 [2023-12-24 20:55:16,719 INFO L378 Elim1Store]: Elim1 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 110 treesize of output 106 [2023-12-24 20:55:16,731 INFO L378 Elim1Store]: Elim1 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 114 treesize of output 106 [2023-12-24 20:55:16,814 INFO L378 Elim1Store]: Elim1 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 141 treesize of output 137 [2023-12-24 20:55:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 20:55:21,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:21,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514646337] [2023-12-24 20:55:21,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514646337] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:21,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:21,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-24 20:55:21,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836576705] [2023-12-24 20:55:21,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:21,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 20:55:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 20:55:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=124, Unknown=19, NotChecked=24, Total=210 [2023-12-24 20:55:21,184 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:21,470 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-12-24 20:55:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:55:21,471 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-24 20:55:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:21,471 INFO L225 Difference]: With dead ends: 30 [2023-12-24 20:55:21,471 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 20:55:21,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=71, Invalid=183, Unknown=22, NotChecked=30, Total=306 [2023-12-24 20:55:21,472 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:21,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2023-12-24 20:55:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 20:55:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-12-24 20:55:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-24 20:55:21,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2023-12-24 20:55:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:21,476 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-24 20:55:21,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-24 20:55:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 20:55:21,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:21,477 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:21,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 20:55:21,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:21,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:21,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1161912507, now seen corresponding path program 2 times [2023-12-24 20:55:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139407129] [2023-12-24 20:55:21,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:55:21,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:21,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:21,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:21,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 20:55:21,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:55:21,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:21,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 20:55:21,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:21,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 20:55:21,803 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:55:21,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:55:21,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 20:55:21,850 INFO L378 Elim1Store]: Elim1 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 [2023-12-24 20:55:21,920 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2023-12-24 20:55:21,920 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-24 20:55:21,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-24 20:55:21,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-12-24 20:55:21,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-24 20:55:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:22,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:22,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 45 treesize of output 49 [2023-12-24 20:55:22,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 40 treesize of output 39 [2023-12-24 20:55:22,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 45 treesize of output 44 [2023-12-24 20:55:22,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 35 treesize of output 39 [2023-12-24 20:55:22,261 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (_ bv0 32)) (not (= (select v_arrayElimArr_6 .cse2) (_ bv0 32))) (not (= (select v_arrayElimArr_5 .cse2) (_ bv0 32))))) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 .cse2) (_ bv0 32))) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv4 32)))) (_ bv0 32)) (not (= (select v_arrayElimArr_4 .cse2) (_ bv0 32))))))) is different from false [2023-12-24 20:55:22,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,359 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-12-24 20:55:22,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,366 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-24 20:55:22,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 195 [2023-12-24 20:55:22,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 185 [2023-12-24 20:55:22,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 162 [2023-12-24 20:55:22,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:22,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 176 [2023-12-24 20:55:25,598 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:55:25,598 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 1 [2023-12-24 20:55:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 20:55:25,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139407129] [2023-12-24 20:55:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139407129] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:25,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-24 20:55:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336650376] [2023-12-24 20:55:25,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:25,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 20:55:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 20:55:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=1, NotChecked=24, Total=210 [2023-12-24 20:55:25,839 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:26,198 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-24 20:55:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 20:55:26,198 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-24 20:55:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:26,199 INFO L225 Difference]: With dead ends: 37 [2023-12-24 20:55:26,199 INFO L226 Difference]: Without dead ends: 24 [2023-12-24 20:55:26,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=276, Unknown=1, NotChecked=34, Total=380 [2023-12-24 20:55:26,199 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:26,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 56 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 92 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2023-12-24 20:55:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-24 20:55:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-12-24 20:55:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-24 20:55:26,203 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-12-24 20:55:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:26,203 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-24 20:55:26,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-24 20:55:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 20:55:26,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:26,204 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:26,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 20:55:26,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:26,407 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:26,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1908211058, now seen corresponding path program 3 times [2023-12-24 20:55:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364274487] [2023-12-24 20:55:26,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 20:55:26,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:55:26,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:26,411 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:55:26,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 20:55:26,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 20:55:26,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:26,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-24 20:55:26,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:26,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 20:55:26,562 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:55:26,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:55:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 20:55:26,669 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:55:26,669 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 15 [2023-12-24 20:55:26,673 INFO L378 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-12-24 20:55:26,721 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-24 20:55:26,721 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 26 [2023-12-24 20:55:26,746 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 20:55:26,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-24 20:55:26,765 INFO L378 Elim1Store]: Elim1 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 [2023-12-24 20:55:26,875 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-24 20:55:26,875 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 147 [2023-12-24 20:55:26,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 124 [2023-12-24 20:55:26,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-24 20:55:27,115 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-24 20:55:27,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 136 [2023-12-24 20:55:27,139 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2023-12-24 20:55:27,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 148 [2023-12-24 20:55:27,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 21 [2023-12-24 20:55:27,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 21 [2023-12-24 20:55:27,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2023-12-24 20:55:27,317 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-12-24 20:55:27,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 56 [2023-12-24 20:55:27,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2023-12-24 20:55:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:55:27,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:27,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:27,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 74 treesize of output 72 [2023-12-24 20:55:27,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:27,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 64 treesize of output 62 [2023-12-24 20:55:27,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_11 .cse0) (_ bv0 32))) (forall ((v_ArrVal_257 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_10 .cse0) (_ bv0 32))) (= .cse1 (_ bv0 32)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_257) .cse1) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (_ bv1 32))))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_11 .cse0) (_ bv0 32))) (= .cse3 (_ bv0 32)) (forall ((v_ArrVal_257 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_10 .cse0) (_ bv0 32))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_257) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) .cse3) (_ bv1 32))))))))) is different from false [2023-12-24 20:55:28,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:28,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 197 treesize of output 191 [2023-12-24 20:55:28,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:28,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 930 treesize of output 961 [2023-12-24 20:55:29,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:29,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 584 treesize of output 548 [2023-12-24 20:55:29,027 INFO L378 Elim1Store]: Elim1 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 539 treesize of output 503 [2023-12-24 20:55:29,041 INFO L378 Elim1Store]: Elim1 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 503 treesize of output 467 [2023-12-24 20:55:29,657 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 3 [2023-12-24 20:55:29,679 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 3 [2023-12-24 20:55:30,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-12-24 20:55:30,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:30,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-12-24 20:55:30,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:30,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 325 [2023-12-24 20:55:30,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:30,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-12-24 20:55:30,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:30,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 325 [2023-12-24 20:55:30,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:31,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-12-24 20:55:31,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:31,138 INFO L378 Elim1Store]: Elim1 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 181 treesize of output 145 [2023-12-24 20:55:31,174 INFO L378 Elim1Store]: Elim1 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 160 treesize of output 142 [2023-12-24 20:55:31,210 INFO L378 Elim1Store]: Elim1 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 160 treesize of output 142 [2023-12-24 20:55:31,262 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 3 [2023-12-24 20:55:31,275 INFO L378 Elim1Store]: Elim1 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 201 treesize of output 165 [2023-12-24 20:55:31,307 INFO L378 Elim1Store]: Elim1 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 181 treesize of output 145 [2023-12-24 20:55:31,362 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 3 [2023-12-24 20:55:31,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-12-24 20:55:31,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:31,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-12-24 20:55:31,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:31,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 325 [2023-12-24 20:55:31,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:31,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2023-12-24 20:55:31,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 322 [2023-12-24 20:55:31,938 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-12-24 20:55:31,986 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-12-24 20:55:32,005 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-12-24 20:55:32,053 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-12-24 20:55:32,056 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-12-24 20:55:32,316 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 37 [2023-12-24 20:55:32,535 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse1))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse1 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse5 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse4 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse4 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse5)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse6 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse6 .cse8)))))) (not (= (_ bv0 1) (select |c_#valid| .cse8)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse9 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse9 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse9)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse11 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse10 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse11)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse12 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse12))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse14 (select (select (store .cse13 .cse12 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse13 .cse12 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse14) (not (= .cse12 .cse14)) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse15 (select (select (store .cse16 .cse17 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse15 (select (select (store .cse16 .cse17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse15 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse17)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse18 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse18 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| .cse18)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse20 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse19 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse19 .cse20)) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse20)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse21 (select (select (store .cse22 .cse23 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse21 (select (select (store .cse22 .cse23 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse21 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse23))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse23 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_12 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse24 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse24 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) v_arrayElimCell_115 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select |c_#valid| v_arrayElimCell_115) (_ bv0 1))) (= .cse25 (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse26 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse28 (select (select (store .cse27 .cse26 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse27 .cse26 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse28) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse28)))))))))) is different from false [2023-12-24 20:55:36,550 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse1))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse1 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse5 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse4 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse4 .cse5))))) (not (= (_ bv0 1) (select |c_#valid| .cse5)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse6 (select (select (store .cse7 .cse8 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 (select (select (store .cse7 .cse8 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse6 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse6 .cse8)))))) (not (= (_ bv0 1) (select |c_#valid| .cse8)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse9 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse9 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse9)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse11 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse10 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse11)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse12 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse12))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse14 (select (select (store .cse13 .cse12 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse13 .cse12 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse14) (not (= .cse12 .cse14)) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32)))))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse15 (select (select (store .cse16 .cse17 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse15 (select (select (store .cse16 .cse17 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse15 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse17)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse18 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse18 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| .cse18)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse20 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse19 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse19 .cse20)) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse20)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse21 (select (select (store .cse22 .cse23 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse21 (select (select (store .cse22 .cse23 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse21 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse23))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse23 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_12 .cse3))) (or (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse24 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse24 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) v_arrayElimCell_115 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (not (= (select |c_#valid| v_arrayElimCell_115) (_ bv0 1))) (= .cse25 (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select v_arrayElimArr_12 .cse3))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse3) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse26 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse26))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse28 (select (select (store .cse27 .cse26 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store .cse27 .cse26 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse28) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse28)))))))))) is different from true [2023-12-24 20:55:37,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,108 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 83 [2023-12-24 20:55:37,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 225 [2023-12-24 20:55:37,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 835 treesize of output 762 [2023-12-24 20:55:37,225 INFO L378 Elim1Store]: Elim1 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 50 treesize of output 42 [2023-12-24 20:55:37,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-24 20:55:37,278 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 20:55:37,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 99 [2023-12-24 20:55:37,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 130 [2023-12-24 20:55:37,333 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-24 20:55:37,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2023-12-24 20:55:37,418 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:55:37,419 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 1 [2023-12-24 20:55:37,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,438 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-24 20:55:37,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 190 [2023-12-24 20:55:37,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-24 20:55:37,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:55:37,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-24 20:55:37,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2023-12-24 20:55:37,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-24 20:55:37,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,726 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 97 [2023-12-24 20:55:37,733 INFO L378 Elim1Store]: Elim1 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 103 treesize of output 73 [2023-12-24 20:55:37,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 244 [2023-12-24 20:55:37,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 167 [2023-12-24 20:55:37,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:37,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 141 [2023-12-24 20:55:38,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 200 [2023-12-24 20:55:38,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,096 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-24 20:55:38,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-24 20:55:38,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2023-12-24 20:55:38,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 113 [2023-12-24 20:55:38,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2023-12-24 20:55:38,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-24 20:55:38,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,506 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 72 [2023-12-24 20:55:38,512 INFO L378 Elim1Store]: Elim1 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 78 treesize of output 54 [2023-12-24 20:55:38,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 175 [2023-12-24 20:55:38,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 118 [2023-12-24 20:55:38,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 100 [2023-12-24 20:55:38,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 339 treesize of output 230 [2023-12-24 20:55:38,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,810 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 50 [2023-12-24 20:55:38,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-24 20:55:38,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 159 [2023-12-24 20:55:38,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 167 [2023-12-24 20:55:38,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 100 [2023-12-24 20:55:38,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:38,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2023-12-24 20:55:39,394 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:55:39,394 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 1 [2023-12-24 20:55:39,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 321 treesize of output 254 [2023-12-24 20:55:39,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2023-12-24 20:55:39,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2023-12-24 20:55:39,647 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:55:39,647 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 1 [2023-12-24 20:55:39,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,669 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2023-12-24 20:55:39,675 INFO L378 Elim1Store]: Elim1 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 67 treesize of output 49 [2023-12-24 20:55:39,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2023-12-24 20:55:39,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 113 [2023-12-24 20:55:39,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 95 [2023-12-24 20:55:39,848 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:55:39,848 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 1 [2023-12-24 20:55:39,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,864 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2023-12-24 20:55:39,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 195 [2023-12-24 20:55:39,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:55:39,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-12-24 20:55:39,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-12-24 20:55:39,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:39,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-12-24 20:55:40,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:40,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 74 [2023-12-24 20:55:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-24 20:55:46,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:46,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364274487] [2023-12-24 20:55:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364274487] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:46,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:46,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-24 20:55:46,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840916090] [2023-12-24 20:55:46,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:46,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 20:55:46,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:46,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 20:55:46,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=222, Unknown=6, NotChecked=62, Total=342 [2023-12-24 20:55:46,921 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:55:51,555 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32))) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0)) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse2 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse1 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse2))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse2 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse6 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse5 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse5 .cse6))))) (not (= (_ bv0 1) (select |c_#valid| .cse6)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse7 (select (select (store .cse8 .cse9 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse7 (select (select (store .cse8 .cse9 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= .cse7 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse7 .cse9)))))) (not (= (_ bv0 1) (select |c_#valid| .cse9)))))) (= (_ bv0 1) (bvadd (select |c_#valid| .cse0) (_ bv1 1))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= .cse10 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse10 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse10 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse10)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse12 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse11 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse12)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse13 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse13))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse15 (select (select (store .cse14 .cse13 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (select (store .cse14 .cse13 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse15) (not (= .cse13 .cse15)) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse16 (select (select (store .cse17 .cse18 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse16 (select (select (store .cse17 .cse18 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= .cse16 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| .cse18)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~a~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse19 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse19 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (= (_ bv0 1) (select |c_#valid| .cse19)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse21 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse20 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))) (not (= .cse20 .cse21)) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| .cse21)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse22 (select (select (store .cse23 .cse24 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse22 (select (select (store .cse23 .cse24 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= .cse22 (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse24))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse24 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select v_arrayElimArr_12 .cse4))) (or (not (= (_ bv0 1) (select |c_#valid| .cse25))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse25 v_prenex_9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (not (= (select v_prenex_9 (_ bv4 32)) (_ bv0 32))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse25 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_prenex_8 (_ bv4 32)) (_ bv0 32)))))))) (forall ((v_arrayElimCell_115 (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) v_arrayElimCell_115 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (not (= (select |c_#valid| v_arrayElimCell_115) (_ bv0 1))) (= .cse26 (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select v_arrayElimArr_12 .cse4))) (or (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 .cse4) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse27 v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (_ bv0 32)) (not (= (select v_arrayElimArr_11 (_ bv4 32)) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse27))) (forall ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12))) (let ((.cse29 (select (select (store .cse28 .cse27 v_arrayElimArr_10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (select (store .cse28 .cse27 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse29) (not (= (select v_arrayElimArr_10 (_ bv4 32)) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse29)))))))))) is different from true [2023-12-24 20:55:56,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:00,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:05,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:09,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:13,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:18,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:22,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:26,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:31,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:35,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:38,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:42,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:46,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:50,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:55,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:58,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:57:03,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:57:07,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:57:09,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:57:13,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:57:17,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:57:21,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:57:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:57:24,584 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2023-12-24 20:57:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 20:57:24,585 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-24 20:57:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:57:24,585 INFO L225 Difference]: With dead ends: 36 [2023-12-24 20:57:24,585 INFO L226 Difference]: Without dead ends: 34 [2023-12-24 20:57:24,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=78, Invalid=346, Unknown=8, NotChecked=120, Total=552 [2023-12-24 20:57:24,586 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 88.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 91.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:57:24,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 89 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 19 Unknown, 86 Unchecked, 91.2s Time] [2023-12-24 20:57:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-24 20:57:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-12-24 20:57:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:57:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-24 20:57:24,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2023-12-24 20:57:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:57:24,592 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-24 20:57:24,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 20:57:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-24 20:57:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 20:57:24,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:57:24,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:57:24,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-24 20:57:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:57:24,797 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:57:24,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:57:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash 676313314, now seen corresponding path program 4 times [2023-12-24 20:57:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:57:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022495128] [2023-12-24 20:57:24,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 20:57:24,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:57:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:57:24,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:57:24,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 20:57:24,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 20:57:24,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:57:24,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 20:57:24,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:57:24,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 20:57:25,889 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:57:25,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 20:57:26,561 INFO L378 Elim1Store]: Elim1 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 [2023-12-24 20:57:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 20:57:27,393 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-24 20:57:27,394 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 15 [2023-12-24 20:57:27,678 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-24 20:57:27,679 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 26 [2023-12-24 20:57:27,982 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 20:57:27,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-24 20:57:28,757 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-24 20:57:28,757 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 67 [2023-12-24 20:57:28,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:57:28,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-24 20:57:30,341 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-12-24 20:57:30,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 87 [2023-12-24 20:57:30,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:57:30,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2023-12-24 20:57:30,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-12-24 20:57:30,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-12-24 20:57:30,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-12-24 20:57:34,107 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 20:57:34,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 50 [2023-12-24 20:57:34,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-24 20:57:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:57:34,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:57:36,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:36,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 140 treesize of output 128 [2023-12-24 20:57:36,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:36,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 120 treesize of output 108 [2023-12-24 20:57:36,774 INFO L378 Elim1Store]: Elim1 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 451 treesize of output 393 [2023-12-24 20:57:37,665 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (and (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 .cse0) (_ bv0 32))) (forall ((v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select .cse1 .cse2) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (= (select v_arrayElimArr_26 .cse0) (_ bv0 32))) (= .cse2 (_ bv0 32)))))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_27 .cse0) (_ bv0 32))) (= .cse4 (_ bv0 32)) (forall ((v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (bvadd (_ bv4 32) .cse4))) (not (= (select v_arrayElimArr_26 .cse0) (_ bv0 32)))))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_27 .cse0) (_ bv0 32))) (= .cse6 (_ bv0 32)) (forall ((v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_26 .cse0) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select .cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (bvadd (_ bv4 32) .cse6))))))))) (forall ((v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 .cse0) (_ bv0 32))) (forall ((v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_26 .cse0) (_ bv0 32))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27))) (select (select .cse8 .cse9) (bvadd (_ bv4 32) (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (= .cse9 (_ bv0 32))))))))) is different from false [2023-12-24 20:57:42,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:42,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 349 treesize of output 318 [2023-12-24 20:57:42,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:42,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 381 treesize of output 350 [2023-12-24 20:57:44,363 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_28 .cse4))) (or (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_314 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse2 v_prenex_313))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (select .cse0 .cse1) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse2 v_prenex_314) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) .cse2) (= .cse1 (_ bv0 32)) (not (= (select v_prenex_313 (_ bv4 32)) (_ bv0 32))) (not (= (select v_prenex_314 (_ bv4 32)) (_ bv0 32))))))) (not (= (select v_arrayElimArr_29 .cse4) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse2)))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select v_arrayElimArr_28 .cse4))) (or (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_318 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse6 v_prenex_318) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse6 v_prenex_317))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (bvadd (_ bv4 32) .cse7)) .cse6) (not (= (select v_prenex_317 (_ bv4 32)) (_ bv0 32))) (not (= (select v_prenex_318 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) .cse7)))) (not (= (select v_arrayElimArr_29 .cse4) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse6)))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_28 .cse4))) (or (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_315 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse9 v_prenex_316))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_prenex_315 (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select .cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse9 v_prenex_315) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (bvadd (_ bv4 32) .cse10))) (= (_ bv0 32) .cse10) (not (= (_ bv0 32) (select v_prenex_316 (_ bv4 32)))))))) (not (= (select v_arrayElimArr_29 .cse4) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| .cse9)))))) (forall ((v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select v_arrayElimArr_28 .cse4))) (or (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_29 .cse4) (_ bv0 32))) (forall ((v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse13 v_arrayElimArr_26) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_27 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_26 (_ bv4 32)) (_ bv0 32))) (= (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse13 v_arrayElimArr_27))) (select (select .cse11 .cse12) (bvadd (_ bv4 32) (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (_ bv0 32)) (= .cse12 (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| .cse13)))))))) is different from false [2023-12-24 20:57:45,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:45,262 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 101 [2023-12-24 20:57:45,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:45,330 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2023-12-24 20:57:45,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:45,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 282 [2023-12-24 20:57:45,995 INFO L224 Elim1Store]: Index analysis took 279 ms [2023-12-24 20:57:55,869 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification. DAG size of input: 216 DAG size of output: 162 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 20:57:55,869 INFO L349 Elim1Store]: treesize reduction 414, result has 57.9 percent of original size [2023-12-24 20:57:55,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 8048 treesize of output 7465 [2023-12-24 20:57:56,175 INFO L224 Elim1Store]: Index analysis took 179 ms [2023-12-24 20:57:57,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:57,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 604 treesize of output 604 [2023-12-24 20:57:57,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:57,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 603 treesize of output 505 [2023-12-24 20:57:57,832 INFO L224 Elim1Store]: Index analysis took 174 ms [2023-12-24 20:57:58,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:58,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 534 treesize of output 550 [2023-12-24 20:57:59,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:57:59,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 521 treesize of output 385 [2023-12-24 21:09:25,463 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 21:09:25,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:09:25,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022495128] [2023-12-24 21:09:25,464 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 21:09:25,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-12-24 21:09:25,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:09:25,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:09:25,665 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-12-24 21:09:25,669 INFO L158 Benchmark]: Toolchain (without parser) took 862199.99ms. Allocated memory was 307.2MB in the beginning and 767.6MB in the end (delta: 460.3MB). Free memory was 255.5MB in the beginning and 352.9MB in the end (delta: -97.4MB). Peak memory consumption was 453.9MB. Max. memory is 8.0GB. [2023-12-24 21:09:25,669 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:09:25,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.45ms. Allocated memory is still 307.2MB. Free memory was 255.3MB in the beginning and 236.9MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 21:09:25,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.21ms. Allocated memory is still 307.2MB. Free memory was 236.9MB in the beginning and 235.1MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 21:09:25,669 INFO L158 Benchmark]: Boogie Preprocessor took 75.21ms. Allocated memory is still 307.2MB. Free memory was 235.1MB in the beginning and 232.7MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:09:25,669 INFO L158 Benchmark]: RCFGBuilder took 291.49ms. Allocated memory is still 307.2MB. Free memory was 232.5MB in the beginning and 274.8MB in the end (delta: -42.4MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2023-12-24 21:09:25,669 INFO L158 Benchmark]: TraceAbstraction took 861438.28ms. Allocated memory was 307.2MB in the beginning and 767.6MB in the end (delta: 460.3MB). Free memory was 274.3MB in the beginning and 352.9MB in the end (delta: -78.6MB). Peak memory consumption was 472.1MB. Max. memory is 8.0GB. [2023-12-24 21:09:25,670 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 346.45ms. Allocated memory is still 307.2MB. Free memory was 255.3MB in the beginning and 236.9MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.21ms. Allocated memory is still 307.2MB. Free memory was 236.9MB in the beginning and 235.1MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.21ms. Allocated memory is still 307.2MB. Free memory was 235.1MB in the beginning and 232.7MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 291.49ms. Allocated memory is still 307.2MB. Free memory was 232.5MB in the beginning and 274.8MB in the end (delta: -42.4MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * TraceAbstraction took 861438.28ms. Allocated memory was 307.2MB in the beginning and 767.6MB in the end (delta: 460.3MB). Free memory was 274.3MB in the beginning and 352.9MB in the end (delta: -78.6MB). Peak memory consumption was 472.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...