./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 15:31:54,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 15:31:54,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 15:31:54,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 15:31:54,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 15:31:54,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 15:31:54,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 15:31:54,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 15:31:54,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 15:31:54,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 15:31:54,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 15:31:54,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 15:31:54,519 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 15:31:54,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 15:31:54,521 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 15:31:54,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 15:31:54,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 15:31:54,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 15:31:54,521 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 15:31:54,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 15:31:54,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 15:31:54,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 15:31:54,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 15:31:54,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 15:31:54,523 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 15:31:54,523 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 15:31:54,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 15:31:54,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 15:31:54,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 15:31:54,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 15:31:54,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:31:54,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 15:31:54,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 15:31:54,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 15:31:54,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 15:31:54,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 15:31:54,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 15:31:54,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 15:31:54,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 15:31:54,526 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2023-11-23 15:31:54,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 15:31:54,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 15:31:54,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 15:31:54,759 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 15:31:54,760 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 15:31:54,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2023-11-23 15:31:55,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 15:31:55,999 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 15:31:56,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2023-11-23 15:31:56,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53f53a0cd/e532a9fb74d9447d8879de15a21a3ef9/FLAG9a9e00ebc [2023-11-23 15:31:56,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53f53a0cd/e532a9fb74d9447d8879de15a21a3ef9 [2023-11-23 15:31:56,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 15:31:56,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 15:31:56,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 15:31:56,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 15:31:56,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 15:31:56,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24953d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56, skipping insertion in model container [2023-11-23 15:31:56,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,084 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 15:31:56,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:31:56,346 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 15:31:56,394 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:31:56,415 INFO L206 MainTranslator]: Completed translation [2023-11-23 15:31:56,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56 WrapperNode [2023-11-23 15:31:56,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 15:31:56,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 15:31:56,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 15:31:56,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 15:31:56,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,471 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2023-11-23 15:31:56,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 15:31:56,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 15:31:56,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 15:31:56,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 15:31:56,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 15:31:56,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 15:31:56,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 15:31:56,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 15:31:56,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (1/1) ... [2023-11-23 15:31:56,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:31:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:31:56,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 15:31:56,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 15:31:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-23 15:31:56,603 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-23 15:31:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 15:31:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 15:31:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 15:31:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 15:31:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 15:31:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 15:31:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 15:31:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 15:31:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 15:31:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 15:31:56,698 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 15:31:56,703 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 15:31:56,993 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 15:31:57,022 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 15:31:57,023 INFO L309 CfgBuilder]: Removed 17 assume(true) statements. [2023-11-23 15:31:57,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:57 BoogieIcfgContainer [2023-11-23 15:31:57,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 15:31:57,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 15:31:57,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 15:31:57,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 15:31:57,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:31:56" (1/3) ... [2023-11-23 15:31:57,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bd6c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:57, skipping insertion in model container [2023-11-23 15:31:57,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:56" (2/3) ... [2023-11-23 15:31:57,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bd6c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:57, skipping insertion in model container [2023-11-23 15:31:57,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:57" (3/3) ... [2023-11-23 15:31:57,030 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2023-11-23 15:31:57,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 15:31:57,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2023-11-23 15:31:57,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 15:31:57,091 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39b07c27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 15:31:57,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2023-11-23 15:31:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 71 states have (on average 2.352112676056338) internal successors, (167), 136 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-23 15:31:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 15:31:57,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:57,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 15:31:57,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:57,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash 11297, now seen corresponding path program 1 times [2023-11-23 15:31:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:57,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147336375] [2023-11-23 15:31:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:57,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:57,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147336375] [2023-11-23 15:31:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147336375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:57,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 15:31:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587293539] [2023-11-23 15:31:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:57,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:31:57,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:57,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:31:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:31:57,371 INFO L87 Difference]: Start difference. First operand has 145 states, 71 states have (on average 2.352112676056338) internal successors, (167), 136 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11-23 15:31:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:57,572 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2023-11-23 15:31:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:31:57,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-23 15:31:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:57,581 INFO L225 Difference]: With dead ends: 135 [2023-11-23 15:31:57,581 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 15:31:57,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:31:57,587 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 115 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:57,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 82 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:31:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 15:31:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2023-11-23 15:31:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 128 states have internal predecessors, (136), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2023-11-23 15:31:57,613 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 2 [2023-11-23 15:31:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:57,614 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2023-11-23 15:31:57,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11-23 15:31:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2023-11-23 15:31:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 15:31:57,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:57,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 15:31:57,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 15:31:57,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:57,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 11298, now seen corresponding path program 1 times [2023-11-23 15:31:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274614394] [2023-11-23 15:31:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274614394] [2023-11-23 15:31:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274614394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:57,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:57,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 15:31:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483052673] [2023-11-23 15:31:57,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:57,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:31:57,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:31:57,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:31:57,682 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11-23 15:31:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:57,777 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2023-11-23 15:31:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:31:57,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-23 15:31:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:57,778 INFO L225 Difference]: With dead ends: 180 [2023-11-23 15:31:57,778 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 15:31:57,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:31:57,779 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 57 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:57,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 160 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:31:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 15:31:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 150. [2023-11-23 15:31:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 148 states have internal predecessors, (175), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2023-11-23 15:31:57,787 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 2 [2023-11-23 15:31:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:57,788 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2023-11-23 15:31:57,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-11-23 15:31:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2023-11-23 15:31:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 15:31:57,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:57,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:31:57,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 15:31:57,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:57,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1296171485, now seen corresponding path program 1 times [2023-11-23 15:31:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008976110] [2023-11-23 15:31:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008976110] [2023-11-23 15:31:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008976110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:57,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:31:57,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207546438] [2023-11-23 15:31:57,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:57,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:31:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:57,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:31:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:31:57,919 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-23 15:31:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:58,052 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2023-11-23 15:31:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:31:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-11-23 15:31:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:58,057 INFO L225 Difference]: With dead ends: 160 [2023-11-23 15:31:58,057 INFO L226 Difference]: Without dead ends: 160 [2023-11-23 15:31:58,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:31:58,065 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 180 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:58,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 67 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:31:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-23 15:31:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2023-11-23 15:31:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 137 states have internal predecessors, (165), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2023-11-23 15:31:58,075 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 7 [2023-11-23 15:31:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:58,076 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2023-11-23 15:31:58,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-23 15:31:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2023-11-23 15:31:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 15:31:58,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:58,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:31:58,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 15:31:58,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:58,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1296171486, now seen corresponding path program 1 times [2023-11-23 15:31:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767533614] [2023-11-23 15:31:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:58,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:58,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767533614] [2023-11-23 15:31:58,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767533614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:58,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:58,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:31:58,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133399148] [2023-11-23 15:31:58,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:58,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 15:31:58,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 15:31:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:31:58,243 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11-23 15:31:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:58,488 INFO L93 Difference]: Finished difference Result 180 states and 214 transitions. [2023-11-23 15:31:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:31:58,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2023-11-23 15:31:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:58,490 INFO L225 Difference]: With dead ends: 180 [2023-11-23 15:31:58,490 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 15:31:58,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:31:58,498 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 143 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:58,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 119 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:31:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 15:31:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 127. [2023-11-23 15:31:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 125 states have internal predecessors, (138), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2023-11-23 15:31:58,515 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 7 [2023-11-23 15:31:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:58,516 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2023-11-23 15:31:58,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11-23 15:31:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2023-11-23 15:31:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 15:31:58,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:58,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:31:58,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 15:31:58,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:58,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:58,518 INFO L85 PathProgramCache]: Analyzing trace with hash 80563974, now seen corresponding path program 1 times [2023-11-23 15:31:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754402345] [2023-11-23 15:31:58,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:58,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754402345] [2023-11-23 15:31:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754402345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:31:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456316115] [2023-11-23 15:31:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:31:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:58,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:31:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:31:58,607 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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-11-23 15:31:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:58,724 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2023-11-23 15:31:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:31:58,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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-11-23 15:31:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:58,726 INFO L225 Difference]: With dead ends: 126 [2023-11-23 15:31:58,727 INFO L226 Difference]: Without dead ends: 126 [2023-11-23 15:31:58,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-23 15:31:58,727 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:58,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 298 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:31:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-23 15:31:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-23 15:31:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.6790123456790123) internal successors, (136), 124 states have internal predecessors, (136), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2023-11-23 15:31:58,742 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 9 [2023-11-23 15:31:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:58,742 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2023-11-23 15:31:58,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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-11-23 15:31:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2023-11-23 15:31:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 15:31:58,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:58,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:31:58,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 15:31:58,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:58,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash 80563975, now seen corresponding path program 1 times [2023-11-23 15:31:58,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:58,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697664915] [2023-11-23 15:31:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:58,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:58,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697664915] [2023-11-23 15:31:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697664915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:58,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:58,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:31:58,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558381825] [2023-11-23 15:31:58,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:58,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:31:58,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:58,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:31:58,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:31:58,885 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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-11-23 15:31:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:59,002 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2023-11-23 15:31:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:31:59,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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-11-23 15:31:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:59,003 INFO L225 Difference]: With dead ends: 125 [2023-11-23 15:31:59,003 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 15:31:59,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-23 15:31:59,004 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:59,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 281 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:31:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 15:31:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-23 15:31:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.654320987654321) internal successors, (134), 123 states have internal predecessors, (134), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2023-11-23 15:31:59,007 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 9 [2023-11-23 15:31:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:59,007 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2023-11-23 15:31:59,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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-11-23 15:31:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2023-11-23 15:31:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 15:31:59,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:59,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:31:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 15:31:59,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:59,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash -108161392, now seen corresponding path program 1 times [2023-11-23 15:31:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:59,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827044604] [2023-11-23 15:31:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:59,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:59,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827044604] [2023-11-23 15:31:59,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827044604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:59,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:59,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 15:31:59,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365321594] [2023-11-23 15:31:59,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:59,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:31:59,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:31:59,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:31:59,033 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:59,127 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-11-23 15:31:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 15:31:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 15:31:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:59,128 INFO L225 Difference]: With dead ends: 134 [2023-11-23 15:31:59,128 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 15:31:59,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:31:59,128 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 114 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:59,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 151 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:31:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 15:31:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 124. [2023-11-23 15:31:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.617283950617284) internal successors, (131), 122 states have internal predecessors, (131), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2023-11-23 15:31:59,132 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 11 [2023-11-23 15:31:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:59,132 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2023-11-23 15:31:59,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2023-11-23 15:31:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 15:31:59,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:59,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:31:59,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 15:31:59,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:59,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash 112853709, now seen corresponding path program 1 times [2023-11-23 15:31:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196908597] [2023-11-23 15:31:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:59,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196908597] [2023-11-23 15:31:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196908597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:59,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 15:31:59,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635974610] [2023-11-23 15:31:59,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:31:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:59,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:31:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:31:59,244 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-11-23 15:31:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:59,491 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-11-23 15:31:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 15:31:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2023-11-23 15:31:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:59,492 INFO L225 Difference]: With dead ends: 123 [2023-11-23 15:31:59,492 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 15:31:59,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:31:59,493 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 149 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:59,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 203 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:31:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 15:31:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 15:31:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 121 states have internal predecessors, (130), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2023-11-23 15:31:59,495 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 11 [2023-11-23 15:31:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:59,495 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2023-11-23 15:31:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-11-23 15:31:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2023-11-23 15:31:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 15:31:59,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:31:59,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:31:59,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 15:31:59,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:31:59,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:31:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash 112853710, now seen corresponding path program 1 times [2023-11-23 15:31:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:31:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831775727] [2023-11-23 15:31:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:31:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:31:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:31:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:31:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:31:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831775727] [2023-11-23 15:31:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831775727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:31:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:31:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 15:31:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705957510] [2023-11-23 15:31:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:31:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 15:31:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:31:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 15:31:59,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 15:31:59,654 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-11-23 15:31:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:31:59,994 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2023-11-23 15:31:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 15:31:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2023-11-23 15:31:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:31:59,995 INFO L225 Difference]: With dead ends: 135 [2023-11-23 15:31:59,996 INFO L226 Difference]: Without dead ends: 135 [2023-11-23 15:31:59,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-23 15:31:59,996 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 183 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:31:59,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 258 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:31:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-23 15:31:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2023-11-23 15:31:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 123 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:31:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2023-11-23 15:31:59,999 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 11 [2023-11-23 15:31:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:31:59,999 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2023-11-23 15:31:59,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-11-23 15:32:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2023-11-23 15:32:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 15:32:00,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:00,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:00,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 15:32:00,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:00,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1657316670, now seen corresponding path program 1 times [2023-11-23 15:32:00,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:00,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266994782] [2023-11-23 15:32:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266994782] [2023-11-23 15:32:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266994782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:00,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 15:32:00,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924720972] [2023-11-23 15:32:00,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:00,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:32:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:32:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:00,046 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:00,161 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2023-11-23 15:32:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:32:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-23 15:32:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:00,162 INFO L225 Difference]: With dead ends: 173 [2023-11-23 15:32:00,162 INFO L226 Difference]: Without dead ends: 173 [2023-11-23 15:32:00,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-23 15:32:00,163 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 77 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:00,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 217 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-23 15:32:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2023-11-23 15:32:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 130 states have internal predecessors, (143), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2023-11-23 15:32:00,166 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 14 [2023-11-23 15:32:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:00,166 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2023-11-23 15:32:00,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2023-11-23 15:32:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 15:32:00,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:00,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:00,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 15:32:00,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:00,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:00,168 INFO L85 PathProgramCache]: Analyzing trace with hash -905550920, now seen corresponding path program 1 times [2023-11-23 15:32:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549804360] [2023-11-23 15:32:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:00,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549804360] [2023-11-23 15:32:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549804360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:00,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:00,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:32:00,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028323546] [2023-11-23 15:32:00,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:00,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:32:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:00,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:32:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:00,234 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-11-23 15:32:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:00,332 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2023-11-23 15:32:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:32:00,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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) Word has length 16 [2023-11-23 15:32:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:00,333 INFO L225 Difference]: With dead ends: 131 [2023-11-23 15:32:00,333 INFO L226 Difference]: Without dead ends: 131 [2023-11-23 15:32:00,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-23 15:32:00,334 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:00,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 274 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-23 15:32:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-11-23 15:32:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 129 states have internal predecessors, (142), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2023-11-23 15:32:00,336 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 16 [2023-11-23 15:32:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:00,337 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2023-11-23 15:32:00,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-11-23 15:32:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2023-11-23 15:32:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 15:32:00,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:00,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:00,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 15:32:00,338 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:00,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash -905550919, now seen corresponding path program 1 times [2023-11-23 15:32:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169248677] [2023-11-23 15:32:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:00,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169248677] [2023-11-23 15:32:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169248677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:00,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:00,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:32:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795257622] [2023-11-23 15:32:00,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:00,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:32:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:32:00,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:00,452 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-11-23 15:32:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:00,551 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2023-11-23 15:32:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:32:00,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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) Word has length 16 [2023-11-23 15:32:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:00,552 INFO L225 Difference]: With dead ends: 130 [2023-11-23 15:32:00,553 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 15:32:00,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-23 15:32:00,553 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:00,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 15:32:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-23 15:32:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.46875) internal successors, (141), 128 states have internal predecessors, (141), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2023-11-23 15:32:00,559 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 16 [2023-11-23 15:32:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:00,559 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2023-11-23 15:32:00,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-11-23 15:32:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2023-11-23 15:32:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 15:32:00,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:00,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:00,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 15:32:00,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:00,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2004592475, now seen corresponding path program 1 times [2023-11-23 15:32:00,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:00,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052078277] [2023-11-23 15:32:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:00,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052078277] [2023-11-23 15:32:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052078277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:00,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:32:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166649476] [2023-11-23 15:32:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:00,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:32:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:00,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:32:00,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:32:00,604 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:00,670 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2023-11-23 15:32:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 15:32:00,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-23 15:32:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:00,671 INFO L225 Difference]: With dead ends: 129 [2023-11-23 15:32:00,671 INFO L226 Difference]: Without dead ends: 129 [2023-11-23 15:32:00,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:00,672 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 18 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:00,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 196 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-23 15:32:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-23 15:32:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 127 states have internal predecessors, (139), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2023-11-23 15:32:00,675 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 18 [2023-11-23 15:32:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:00,675 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2023-11-23 15:32:00,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2023-11-23 15:32:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 15:32:00,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:00,676 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:00,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 15:32:00,676 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:00,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1635894325, now seen corresponding path program 1 times [2023-11-23 15:32:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276699222] [2023-11-23 15:32:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:00,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276699222] [2023-11-23 15:32:00,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276699222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794222367] [2023-11-23 15:32:00,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:00,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:00,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:00,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:00,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 15:32:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:00,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-23 15:32:00,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:00,901 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-11-23 15:32:00,906 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-11-23 15:32:00,924 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 19 treesize of output 18 [2023-11-23 15:32:00,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 19 treesize of output 18 [2023-11-23 15:32:00,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:00,957 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 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-23 15:32:00,964 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 30 treesize of output 21 [2023-11-23 15:32:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:01,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:32:01,297 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 10 treesize of output 8 [2023-11-23 15:32:01,301 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 14 treesize of output 12 [2023-11-23 15:32:01,324 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 10 treesize of output 8 [2023-11-23 15:32:01,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:32:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794222367] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:32:01,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:32:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2023-11-23 15:32:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654544549] [2023-11-23 15:32:01,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:32:01,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 15:32:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 15:32:01,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:32:01,337 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-11-23 15:32:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:01,599 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2023-11-23 15:32:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 15:32:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 18 [2023-11-23 15:32:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:01,600 INFO L225 Difference]: With dead ends: 182 [2023-11-23 15:32:01,600 INFO L226 Difference]: Without dead ends: 182 [2023-11-23 15:32:01,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-23 15:32:01,601 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 357 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:01,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 240 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:32:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-23 15:32:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2023-11-23 15:32:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.4508196721311475) internal successors, (177), 153 states have internal predecessors, (177), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2023-11-23 15:32:01,606 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 18 [2023-11-23 15:32:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:01,607 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2023-11-23 15:32:01,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-11-23 15:32:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2023-11-23 15:32:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 15:32:01,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:01,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:01,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 15:32:01,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 15:32:01,822 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:01,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1644178272, now seen corresponding path program 1 times [2023-11-23 15:32:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:01,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671094267] [2023-11-23 15:32:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671094267] [2023-11-23 15:32:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671094267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 15:32:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542434248] [2023-11-23 15:32:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:32:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:32:02,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:32:02,110 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-11-23 15:32:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:02,346 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2023-11-23 15:32:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 15:32:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 18 [2023-11-23 15:32:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:02,347 INFO L225 Difference]: With dead ends: 151 [2023-11-23 15:32:02,347 INFO L226 Difference]: Without dead ends: 151 [2023-11-23 15:32:02,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:32:02,348 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:02,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 346 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:32:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-23 15:32:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2023-11-23 15:32:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 132 states have internal predecessors, (153), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2023-11-23 15:32:02,351 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 18 [2023-11-23 15:32:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:02,351 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2023-11-23 15:32:02,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-11-23 15:32:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2023-11-23 15:32:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 15:32:02,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:02,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:02,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 15:32:02,352 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:02,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1644178271, now seen corresponding path program 1 times [2023-11-23 15:32:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:02,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207567720] [2023-11-23 15:32:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:02,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207567720] [2023-11-23 15:32:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207567720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 15:32:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621631575] [2023-11-23 15:32:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:02,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:32:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:32:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:32:02,468 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-11-23 15:32:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:02,603 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2023-11-23 15:32:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:32:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2023-11-23 15:32:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:02,604 INFO L225 Difference]: With dead ends: 133 [2023-11-23 15:32:02,604 INFO L226 Difference]: Without dead ends: 133 [2023-11-23 15:32:02,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:32:02,605 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:02,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 205 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-23 15:32:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-23 15:32:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 131 states have internal predecessors, (152), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2023-11-23 15:32:02,608 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2023-11-23 15:32:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:02,608 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2023-11-23 15:32:02,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-11-23 15:32:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2023-11-23 15:32:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 15:32:02,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:02,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:02,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 15:32:02,609 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:02,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:02,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1129137275, now seen corresponding path program 1 times [2023-11-23 15:32:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:02,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017673101] [2023-11-23 15:32:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017673101] [2023-11-23 15:32:02,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017673101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:02,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:02,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 15:32:02,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199223578] [2023-11-23 15:32:02,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:02,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:32:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:02,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:32:02,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:02,637 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:02,721 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2023-11-23 15:32:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:32:02,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-23 15:32:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:02,722 INFO L225 Difference]: With dead ends: 130 [2023-11-23 15:32:02,722 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 15:32:02,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-23 15:32:02,723 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:02,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 218 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 15:32:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-11-23 15:32:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.4) internal successors, (147), 128 states have internal predecessors, (147), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2023-11-23 15:32:02,725 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 20 [2023-11-23 15:32:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:02,725 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2023-11-23 15:32:02,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2023-11-23 15:32:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 15:32:02,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:02,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:02,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 15:32:02,726 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:02,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash 485472380, now seen corresponding path program 1 times [2023-11-23 15:32:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129185458] [2023-11-23 15:32:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129185458] [2023-11-23 15:32:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129185458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:02,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:02,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:32:02,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704993504] [2023-11-23 15:32:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:02,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:32:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:32:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:32:02,818 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:02,887 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2023-11-23 15:32:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 15:32:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-23 15:32:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:02,888 INFO L225 Difference]: With dead ends: 130 [2023-11-23 15:32:02,889 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 15:32:02,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:02,889 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:02,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 192 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 15:32:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2023-11-23 15:32:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 127 states have internal predecessors, (146), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2023-11-23 15:32:02,894 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 21 [2023-11-23 15:32:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:02,894 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2023-11-23 15:32:02,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2023-11-23 15:32:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 15:32:02,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:02,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:02,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 15:32:02,895 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:02,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1666643759, now seen corresponding path program 1 times [2023-11-23 15:32:02,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:02,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596739348] [2023-11-23 15:32:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:02,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:02,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:02,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596739348] [2023-11-23 15:32:02,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596739348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:02,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:02,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 15:32:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753130774] [2023-11-23 15:32:02,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:02,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 15:32:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 15:32:03,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 15:32:03,000 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:03,238 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2023-11-23 15:32:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 15:32:03,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 15:32:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:03,239 INFO L225 Difference]: With dead ends: 144 [2023-11-23 15:32:03,239 INFO L226 Difference]: Without dead ends: 144 [2023-11-23 15:32:03,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-23 15:32:03,240 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 140 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:03,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 217 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:32:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-23 15:32:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2023-11-23 15:32:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 134 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2023-11-23 15:32:03,242 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 23 [2023-11-23 15:32:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:03,242 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2023-11-23 15:32:03,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2023-11-23 15:32:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 15:32:03,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:03,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:03,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 15:32:03,243 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:03,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1233345126, now seen corresponding path program 1 times [2023-11-23 15:32:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:03,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962758163] [2023-11-23 15:32:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:32:03,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:03,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962758163] [2023-11-23 15:32:03,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962758163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:03,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:03,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 15:32:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618559396] [2023-11-23 15:32:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:03,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:32:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:32:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:32:03,277 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-11-23 15:32:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:03,334 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2023-11-23 15:32:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:32:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2023-11-23 15:32:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:03,335 INFO L225 Difference]: With dead ends: 140 [2023-11-23 15:32:03,335 INFO L226 Difference]: Without dead ends: 140 [2023-11-23 15:32:03,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:32:03,335 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:03,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-23 15:32:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-23 15:32:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 138 states have internal predecessors, (155), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2023-11-23 15:32:03,338 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 23 [2023-11-23 15:32:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:03,338 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2023-11-23 15:32:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-11-23 15:32:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2023-11-23 15:32:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 15:32:03,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:03,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 15:32:03,339 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:03,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash -166297911, now seen corresponding path program 1 times [2023-11-23 15:32:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235874927] [2023-11-23 15:32:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:03,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235874927] [2023-11-23 15:32:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235874927] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890996591] [2023-11-23 15:32:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:03,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:03,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:03,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:03,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 15:32:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:03,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 15:32:03,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:03,558 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 19 treesize of output 1 [2023-11-23 15:32:03,582 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 19 treesize of output 7 [2023-11-23 15:32:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:32:03,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 15:32:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890996591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:03,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 15:32:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-23 15:32:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152077901] [2023-11-23 15:32:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:03,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:32:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:32:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 15:32:03,592 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-23 15:32:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:03,666 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2023-11-23 15:32:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 15:32:03,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2023-11-23 15:32:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:03,667 INFO L225 Difference]: With dead ends: 135 [2023-11-23 15:32:03,667 INFO L226 Difference]: Without dead ends: 135 [2023-11-23 15:32:03,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 15:32:03,669 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 194 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-23 15:32:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2023-11-23 15:32:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 132 states have internal predecessors, (146), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2023-11-23 15:32:03,671 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 25 [2023-11-23 15:32:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:03,672 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2023-11-23 15:32:03,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-11-23 15:32:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2023-11-23 15:32:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 15:32:03,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:03,673 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:03,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 15:32:03,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-23 15:32:03,885 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:03,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1792229070, now seen corresponding path program 1 times [2023-11-23 15:32:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314575269] [2023-11-23 15:32:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:04,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314575269] [2023-11-23 15:32:04,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314575269] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775768273] [2023-11-23 15:32:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:04,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:04,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:04,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:04,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 15:32:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:04,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-23 15:32:04,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:04,207 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-11-23 15:32:04,209 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-11-23 15:32:04,214 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-23 15:32:04,218 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 20 [2023-11-23 15:32:04,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:04,244 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2023-11-23 15:32:04,259 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 23 [2023-11-23 15:32:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:32:04,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:32:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:32:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775768273] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:32:04,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:32:04,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 8 [2023-11-23 15:32:04,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344252108] [2023-11-23 15:32:04,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:32:04,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:32:04,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:32:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:32:04,500 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-11-23 15:32:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:04,808 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2023-11-23 15:32:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 15:32:04,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 26 [2023-11-23 15:32:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:04,809 INFO L225 Difference]: With dead ends: 181 [2023-11-23 15:32:04,809 INFO L226 Difference]: Without dead ends: 181 [2023-11-23 15:32:04,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-23 15:32:04,810 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 112 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:04,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 231 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 15:32:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-23 15:32:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 138. [2023-11-23 15:32:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 136 states have internal predecessors, (148), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2023-11-23 15:32:04,812 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 26 [2023-11-23 15:32:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:04,812 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2023-11-23 15:32:04,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-11-23 15:32:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2023-11-23 15:32:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 15:32:04,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:04,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:04,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 15:32:05,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:05,025 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:05,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash -275474027, now seen corresponding path program 1 times [2023-11-23 15:32:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475968107] [2023-11-23 15:32:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:32:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475968107] [2023-11-23 15:32:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475968107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156306641] [2023-11-23 15:32:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:05,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:05,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:05,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:05,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 15:32:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:05,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 15:32:05,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:05,209 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 13 treesize of output 9 [2023-11-23 15:32:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:32:05,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:32:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:32:05,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156306641] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:32:05,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:32:05,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2023-11-23 15:32:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862264944] [2023-11-23 15:32:05,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:32:05,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:32:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:32:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:05,247 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 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-11-23 15:32:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:05,339 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2023-11-23 15:32:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 15:32:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 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) Word has length 27 [2023-11-23 15:32:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:05,340 INFO L225 Difference]: With dead ends: 145 [2023-11-23 15:32:05,340 INFO L226 Difference]: Without dead ends: 124 [2023-11-23 15:32:05,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:32:05,340 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:05,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-23 15:32:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-23 15:32:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.33) internal successors, (133), 122 states have internal predecessors, (133), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2023-11-23 15:32:05,342 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 27 [2023-11-23 15:32:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:05,342 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2023-11-23 15:32:05,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 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-11-23 15:32:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2023-11-23 15:32:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 15:32:05,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:05,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:05,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 15:32:05,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:05,552 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:05,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1073345276, now seen corresponding path program 1 times [2023-11-23 15:32:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012779244] [2023-11-23 15:32:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:05,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012779244] [2023-11-23 15:32:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012779244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:32:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:32:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 15:32:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572485733] [2023-11-23 15:32:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:32:05,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 15:32:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 15:32:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:32:05,685 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:05,856 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2023-11-23 15:32:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 15:32:05,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-23 15:32:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:05,857 INFO L225 Difference]: With dead ends: 131 [2023-11-23 15:32:05,857 INFO L226 Difference]: Without dead ends: 131 [2023-11-23 15:32:05,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-23 15:32:05,858 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:05,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 347 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:32:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-23 15:32:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2023-11-23 15:32:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 114 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2023-11-23 15:32:05,860 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 29 [2023-11-23 15:32:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:05,860 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2023-11-23 15:32:05,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2023-11-23 15:32:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 15:32:05,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:05,860 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:05,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-23 15:32:05,860 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:05,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash 59812451, now seen corresponding path program 1 times [2023-11-23 15:32:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343781382] [2023-11-23 15:32:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343781382] [2023-11-23 15:32:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343781382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471499353] [2023-11-23 15:32:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:06,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:06,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 15:32:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:06,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 15:32:06,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:06,275 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 5 [2023-11-23 15:32:06,288 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-11-23 15:32:06,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:32:06,330 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 11 treesize of output 11 [2023-11-23 15:32:06,352 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-11-23 15:32:06,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:32:06,360 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 23 treesize of output 11 [2023-11-23 15:32:06,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:32:06,434 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 41 treesize of output 38 [2023-11-23 15:32:06,438 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 24 treesize of output 11 [2023-11-23 15:32:06,444 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 16 treesize of output 8 [2023-11-23 15:32:06,450 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-11-23 15:32:06,468 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-11-23 15:32:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:06,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:32:06,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-23 15:32:06,578 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_973 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_973) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_972) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-23 15:32:06,583 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_973 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_973) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_972) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-23 15:32:06,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:06,589 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 33 treesize of output 34 [2023-11-23 15:32:06,593 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 60 treesize of output 52 [2023-11-23 15:32:06,597 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 22 [2023-11-23 15:32:06,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_970 (Array Int Int))) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_973) v_arrayElimCell_26 v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= v_ArrVal_970 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or (not .cse3) (forall ((v_ArrVal_975 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (or (not (= v_ArrVal_970 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_973) v_arrayElimCell_26 v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or .cse3 (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_970 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|))))))))) is different from false [2023-11-23 15:32:06,795 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 251 treesize of output 247 [2023-11-23 15:32:06,802 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 163 treesize of output 159 [2023-11-23 15:32:06,807 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 159 treesize of output 147 [2023-11-23 15:32:06,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:32:06,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:06,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 178 [2023-11-23 15:32:06,840 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 127 treesize of output 123 [2023-11-23 15:32:06,848 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 123 treesize of output 119 [2023-11-23 15:32:06,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:32:06,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:32:06,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2023-11-23 15:32:06,885 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:32:06,886 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 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-23 15:32:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471499353] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:32:06,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:32:06,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2023-11-23 15:32:06,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446018260] [2023-11-23 15:32:06,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:32:06,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 15:32:06,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:06,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 15:32:06,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=334, Unknown=9, NotChecked=164, Total=600 [2023-11-23 15:32:06,903 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:07,223 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) 1) (forall ((v_ArrVal_970 (Array Int Int))) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970))) (or (= (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_973) v_arrayElimCell_26 v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= v_ArrVal_970 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 0)) (forall ((v_ArrVal_975 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_973 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_973) v_arrayElimCell_26 v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (or (not .cse3) (forall ((v_ArrVal_975 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (or (not (= v_ArrVal_970 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_973) v_arrayElimCell_26 v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_15| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_15|) 0)) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970) |v_ULTIMATE.start_main_#t~malloc3#1.base_15| v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_970 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_15|))) (or .cse3 (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_970 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_15| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_15|) 0)) (forall ((v_ArrVal_970 (Array Int Int))) (or (not (= v_ArrVal_970 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_970 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_970))) (or (= (select (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_15| v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_15| v_ArrVal_973) v_arrayElimCell_26 v_ArrVal_975) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))))) is different from false [2023-11-23 15:32:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:07,727 INFO L93 Difference]: Finished difference Result 343 states and 385 transitions. [2023-11-23 15:32:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 15:32:07,728 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-23 15:32:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:07,729 INFO L225 Difference]: With dead ends: 343 [2023-11-23 15:32:07,729 INFO L226 Difference]: Without dead ends: 343 [2023-11-23 15:32:07,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=1100, Unknown=11, NotChecked=380, Total=1806 [2023-11-23 15:32:07,730 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 427 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 64 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 1203 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:07,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 531 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 753 Invalid, 15 Unknown, 1203 Unchecked, 0.5s Time] [2023-11-23 15:32:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-11-23 15:32:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 155. [2023-11-23 15:32:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 153 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2023-11-23 15:32:07,733 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 31 [2023-11-23 15:32:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:07,733 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2023-11-23 15:32:07,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2023-11-23 15:32:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 15:32:07,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:07,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:07,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 15:32:07,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-23 15:32:07,945 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:07,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1433951062, now seen corresponding path program 1 times [2023-11-23 15:32:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756486715] [2023-11-23 15:32:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:07,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756486715] [2023-11-23 15:32:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756486715] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602914354] [2023-11-23 15:32:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:08,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:08,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 15:32:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:08,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-23 15:32:08,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:08,317 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 5 [2023-11-23 15:32:08,369 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 15:32:08,369 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 17 treesize of output 21 [2023-11-23 15:32:08,421 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-11-23 15:32:08,486 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:32:08,486 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 34 treesize of output 33 [2023-11-23 15:32:08,527 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:32:08,528 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 33 treesize of output 24 [2023-11-23 15:32:08,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:32:08,552 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 34 treesize of output 33 [2023-11-23 15:32:08,705 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 25 treesize of output 13 [2023-11-23 15:32:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:08,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:32:08,920 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_121| Int) (v_ArrVal_1073 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_121|) (< |v_ULTIMATE.start_main_~end~0#1.offset_121| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1071))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1073)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_121|)) 1))) is different from false [2023-11-23 15:32:08,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:08,964 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 38 treesize of output 31 [2023-11-23 15:32:08,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:08,972 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 252 treesize of output 227 [2023-11-23 15:32:08,993 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 171 treesize of output 163 [2023-11-23 15:32:09,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:09,000 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 163 treesize of output 159 [2023-11-23 15:32:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602914354] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:32:10,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:32:10,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 30 [2023-11-23 15:32:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925457700] [2023-11-23 15:32:10,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:32:10,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 15:32:10,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 15:32:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=706, Unknown=14, NotChecked=56, Total=930 [2023-11-23 15:32:10,611 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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-11-23 15:32:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:11,821 INFO L93 Difference]: Finished difference Result 257 states and 285 transitions. [2023-11-23 15:32:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-23 15:32:11,822 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 35 [2023-11-23 15:32:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:11,823 INFO L225 Difference]: With dead ends: 257 [2023-11-23 15:32:11,823 INFO L226 Difference]: Without dead ends: 257 [2023-11-23 15:32:11,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=258, Invalid=1138, Unknown=14, NotChecked=72, Total=1482 [2023-11-23 15:32:11,824 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 673 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:11,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 472 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1183 Invalid, 0 Unknown, 235 Unchecked, 0.9s Time] [2023-11-23 15:32:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-23 15:32:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 199. [2023-11-23 15:32:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 176 states have (on average 1.3068181818181819) internal successors, (230), 197 states have internal predecessors, (230), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2023-11-23 15:32:11,826 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 35 [2023-11-23 15:32:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:11,827 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2023-11-23 15:32:11,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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-11-23 15:32:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2023-11-23 15:32:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 15:32:11,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:11,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:11,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 15:32:12,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-23 15:32:12,037 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:12,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1433951063, now seen corresponding path program 1 times [2023-11-23 15:32:12,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:12,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548681578] [2023-11-23 15:32:12,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:12,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548681578] [2023-11-23 15:32:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548681578] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89604302] [2023-11-23 15:32:12,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:12,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:12,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:12,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:12,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 15:32:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:12,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 15:32:12,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:12,639 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 5 [2023-11-23 15:32:12,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:32:12,685 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 11 treesize of output 11 [2023-11-23 15:32:12,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-11-23 15:32:12,716 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-11-23 15:32:12,723 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-11-23 15:32:12,788 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:32:12,788 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 50 treesize of output 45 [2023-11-23 15:32:12,794 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 24 treesize of output 11 [2023-11-23 15:32:12,849 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 15:32:12,849 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 33 treesize of output 24 [2023-11-23 15:32:12,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:32:12,856 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-11-23 15:32:12,877 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:32:12,877 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 50 treesize of output 45 [2023-11-23 15:32:12,880 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 24 treesize of output 11 [2023-11-23 15:32:13,037 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 25 treesize of output 13 [2023-11-23 15:32:13,039 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 7 treesize of output 3 [2023-11-23 15:32:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:13,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:32:13,440 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_126| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1171) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1175) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_126|) 9)) (< |v_ULTIMATE.start_main_~end~0#1.offset_126| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_126|))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_126| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1170))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1171) .cse0 v_ArrVal_1175) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_126|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1174) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_126|))))) (< |v_ULTIMATE.start_main_~end~0#1.offset_126| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_126|)))) is different from false [2023-11-23 15:32:13,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_126| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_126| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_126|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1171) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1175) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_126|) 9)))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_126| Int) (v_ArrVal_1175 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_126| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_126|) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1170))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1171) .cse1 v_ArrVal_1175) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_126|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1174) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_126|))))))))) is different from false [2023-11-23 15:32:13,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:13,469 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 73 treesize of output 74 [2023-11-23 15:32:13,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:13,473 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 65 treesize of output 50 [2023-11-23 15:32:13,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:13,486 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 632 treesize of output 567 [2023-11-23 15:32:13,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:13,511 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 1127 treesize of output 1070 [2023-11-23 15:32:13,539 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 547 treesize of output 523 [2023-11-23 15:32:13,564 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 523 treesize of output 499 [2023-11-23 15:32:13,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:13,578 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 499 treesize of output 455 [2023-11-23 15:32:13,591 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 447 treesize of output 439 [2023-11-23 15:32:13,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:13,923 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 38 treesize of output 39 [2023-11-23 15:32:13,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:13,932 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 30 treesize of output 31 [2023-11-23 15:32:13,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:32:13,936 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 28 treesize of output 20 [2023-11-23 15:32:13,938 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:32:13,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:32:13,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:32:13,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-23 15:32:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89604302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:32:14,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:32:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 30 [2023-11-23 15:32:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242258192] [2023-11-23 15:32:14,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:32:14,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 15:32:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:32:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 15:32:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=698, Unknown=6, NotChecked=110, Total=930 [2023-11-23 15:32:14,087 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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-11-23 15:32:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:32:15,202 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2023-11-23 15:32:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 15:32:15,202 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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 35 [2023-11-23 15:32:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:32:15,203 INFO L225 Difference]: With dead ends: 238 [2023-11-23 15:32:15,203 INFO L226 Difference]: Without dead ends: 238 [2023-11-23 15:32:15,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1633, Unknown=6, NotChecked=174, Total=2162 [2023-11-23 15:32:15,205 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 728 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 15:32:15,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 492 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1169 Invalid, 0 Unknown, 412 Unchecked, 0.7s Time] [2023-11-23 15:32:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-23 15:32:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 197. [2023-11-23 15:32:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 195 states have internal predecessors, (226), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:32:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2023-11-23 15:32:15,208 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 35 [2023-11-23 15:32:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:32:15,208 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2023-11-23 15:32:15,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 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-11-23 15:32:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2023-11-23 15:32:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 15:32:15,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:32:15,209 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:32:15,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 15:32:15,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:15,421 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:32:15,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:32:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash -875153010, now seen corresponding path program 1 times [2023-11-23 15:32:15,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:32:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030787573] [2023-11-23 15:32:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:32:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:16,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:32:16,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030787573] [2023-11-23 15:32:16,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030787573] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:32:16,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094596083] [2023-11-23 15:32:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:32:16,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:32:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:32:16,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:32:16,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 15:32:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:32:16,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 15:32:16,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:32:16,352 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 5 [2023-11-23 15:32:16,371 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-11-23 15:32:16,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:32:16,409 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 11 treesize of output 11 [2023-11-23 15:32:16,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:32:16,441 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 23 treesize of output 11 [2023-11-23 15:32:16,446 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-11-23 15:32:16,518 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:32:16,519 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 41 treesize of output 38 [2023-11-23 15:32:16,522 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 24 treesize of output 11 [2023-11-23 15:32:16,537 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 16 treesize of output 8 [2023-11-23 15:32:16,565 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-11-23 15:32:16,624 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-23 15:32:16,625 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 16 treesize of output 18 [2023-11-23 15:32:16,630 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 16 treesize of output 11 [2023-11-23 15:32:16,663 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 15 treesize of output 1 [2023-11-23 15:32:16,684 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-11-23 15:32:16,761 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:32:16,762 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 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-23 15:32:16,767 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 24 treesize of output 11 [2023-11-23 15:32:16,774 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 24 treesize of output 12 [2023-11-23 15:32:16,797 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-11-23 15:32:16,805 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-11-23 15:32:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:32:16,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:32:16,887 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-23 15:32:16,892 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-23 15:32:16,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1331 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1332) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1331) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1334)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2023-11-23 15:32:16,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:16,961 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 33 treesize of output 34 [2023-11-23 15:32:16,963 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 60 treesize of output 52 [2023-11-23 15:32:16,966 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 22 [2023-11-23 15:32:16,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1329))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or .cse2 (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1329) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (or (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1329) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not .cse2)))) is different from false [2023-11-23 15:32:19,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:19,450 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 168 treesize of output 137 [2023-11-23 15:32:19,455 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 257 treesize of output 233 [2023-11-23 15:32:19,466 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 219 treesize of output 213 [2023-11-23 15:32:19,578 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-11-23 15:32:19,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 330 [2023-11-23 15:32:19,597 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 230 treesize of output 218 [2023-11-23 15:32:29,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse9 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse5 (not .cse9)) (.cse8 (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_31 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_30 (Array Int Int)) (v_prenex_27 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (.cse11 (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int)) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= (select (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse38 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))) (and (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_31 Int)) (or (forall ((v_arrayElimCell_95 Int)) (or (= v_prenex_31 v_arrayElimCell_95) (forall ((v_prenex_30 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_95))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_31 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (forall ((v_arrayElimCell_95 Int) (v_prenex_30 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_31 v_arrayElimCell_95) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|))))) (or (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) .cse5) (or .cse5 (forall ((v_arrayElimCell_95 Int) (v_ArrVal_1324 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_31 v_arrayElimCell_95) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_95)))) (or .cse5 (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (or (and (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_31 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (forall ((v_arrayElimCell_95 Int) (v_prenex_30 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_31 v_arrayElimCell_95) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_95) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_95) (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|))))) .cse8) .cse9) (or .cse5 (forall ((v_arrayElimCell_95 Int) (v_ArrVal_1324 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_31 v_arrayElimCell_95) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31)))) (or .cse5 (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (or (and .cse11 (forall ((v_ArrVal_1324 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_88 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse9) (or .cse9 (and .cse8 (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_31 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (forall ((v_arrayElimCell_95 Int)) (or (forall ((v_prenex_30 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_95) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_95))) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (= (select (select (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (forall ((v_ArrVal_1324 (Array Int Int))) (or (forall ((v_prenex_31 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (forall ((v_arrayElimCell_95 Int)) (or (= v_prenex_31 v_arrayElimCell_95) (forall ((v_prenex_30 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse5 (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (= (select (select (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (or .cse5 (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (or .cse5 (forall ((v_arrayElimCell_95 Int) (v_ArrVal_1324 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_31 v_arrayElimCell_95) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_95)))) (or .cse5 (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (or .cse9 (and (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (= (select (select (store .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) .cse11)) (forall ((v_ArrVal_1324 (Array Int Int))) (or (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int) (v_arrayElimCell_88 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (= (select (select (store .cse25 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse25 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_1324 (Array Int Int))) (or (forall ((v_prenex_31 Int)) (or (forall ((v_arrayElimCell_95 Int)) (or (= v_prenex_31 v_arrayElimCell_95) (forall ((v_prenex_30 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_95) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_95))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse9 (forall ((v_ArrVal_1324 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_prenex_27 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|)))) (or .cse9 (and (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimCell_88 Int)) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (= (select (select (store .cse28 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse28 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88))))) .cse11)) (or (and .cse11 (forall ((v_ArrVal_1324 (Array Int Int))) (or (forall ((v_arrayElimCell_88 Int)) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_88) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= (select (select (store .cse30 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88))) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse9) (or .cse9 (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse32 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (or (and (forall ((v_ArrVal_1324 (Array Int Int))) (or (forall ((v_arrayElimCell_88 Int)) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_arrayElimCell_86 Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= (select (select (store .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88))) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) .cse11) .cse9) (or .cse9 (and .cse8 (forall ((v_ArrVal_1324 (Array Int Int))) (or (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_31 Int)) (or (forall ((v_arrayElimCell_95 Int) (v_prenex_30 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (or (= (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_95 v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_95) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_95) (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_31 v_prenex_30) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_31) (= v_prenex_31 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (or .cse9 (and (forall ((v_ArrVal_1324 (Array Int Int))) (or (forall ((v_arrayElimCell_88 Int)) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1324))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1329))) (or (= (select (select (store .cse36 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1325) v_arrayElimCell_88 v_ArrVal_1329) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse36 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1332) v_arrayElimCell_86 v_ArrVal_1334) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_88))) (not (= v_ArrVal_1324 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1324 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) .cse11))))) is different from false [2023-11-23 15:32:47,372 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 17315 treesize of output 17275 [2023-11-23 15:32:47,482 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 1799 treesize of output 1783 [2023-11-23 15:32:47,506 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 1783 treesize of output 1767 [2023-11-23 15:32:47,528 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 1767 treesize of output 1763 [2023-11-23 15:32:47,554 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 1763 treesize of output 1755 [2023-11-23 15:32:47,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:32:48,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:32:48,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 20 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 20 new quantified variables, introduced 40 case distinctions, treesize of input 1755 treesize of output 5296 [2023-11-23 15:32:48,605 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 1555 treesize of output 1551 [2023-11-23 15:32:48,942 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 1551 treesize of output 1543 [2023-11-23 15:32:49,270 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 1543 treesize of output 1539 [2023-11-23 15:32:49,597 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 1539 treesize of output 1531 [2023-11-23 15:32:49,928 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 1531 treesize of output 1519 [2023-11-23 15:32:50,266 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 1519 treesize of output 1511 [2023-11-23 15:32:50,602 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 1511 treesize of output 1507 [2023-11-23 15:32:50,935 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 1507 treesize of output 1499 [2023-11-23 15:32:51,280 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 1499 treesize of output 1495 [2023-11-23 15:32:51,619 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 1495 treesize of output 1491 [2023-11-23 15:32:51,957 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 1491 treesize of output 1487 [2023-11-23 15:32:52,300 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 1487 treesize of output 1475 [2023-11-23 15:32:52,644 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 1475 treesize of output 1471 [2023-11-23 15:32:52,984 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 1471 treesize of output 1467 [2023-11-23 15:32:53,412 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 1467 treesize of output 1463 [2023-11-23 15:32:53,756 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 1463 treesize of output 1459 [2023-11-23 15:32:54,110 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 1459 treesize of output 1455 [2023-11-23 15:32:54,462 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 1455 treesize of output 1451 [2023-11-23 15:32:54,802 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 1451 treesize of output 1439 [2023-11-23 15:32:55,158 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 1439 treesize of output 1431 [2023-11-23 15:32:55,515 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 1431 treesize of output 1427 [2023-11-23 15:32:55,865 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 1427 treesize of output 1423 [2023-11-23 15:32:56,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 1423 treesize of output 1419 [2023-11-23 15:32:56,569 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 1419 treesize of output 1415 [2023-11-23 15:32:56,907 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 1415 treesize of output 1411 [2023-11-23 15:32:57,268 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 1411 treesize of output 1407 [2023-11-23 15:32:57,629 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 1407 treesize of output 1403 [2023-11-23 15:32:58,000 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 1403 treesize of output 1395 [2023-11-23 15:32:58,334 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 1395 treesize of output 1391 [2023-11-23 15:32:58,700 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 1391 treesize of output 1387 [2023-11-23 15:32:59,073 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 1387 treesize of output 1383 [2023-11-23 15:32:59,450 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 1383 treesize of output 1379 [2023-11-23 15:32:59,794 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 1379 treesize of output 1375 [2023-11-23 15:33:00,185 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 1375 treesize of output 1367 [2023-11-23 15:33:00,596 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 1367 treesize of output 1363 [2023-11-23 15:33:00,984 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 1363 treesize of output 1359 [2023-11-23 15:33:02,648 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:33:02,665 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:33:03,019 INFO L224 Elim1Store]: Index analysis took 354 ms [2023-11-23 15:33:03,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:33:03,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 18 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 2763 [2023-11-23 15:33:04,748 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:33:04,767 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:33:04,771 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:33:04,772 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 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-23 15:33:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:33:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094596083] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:33:06,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:33:06,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 43 [2023-11-23 15:33:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088868644] [2023-11-23 15:33:06,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:33:06,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-23 15:33:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:33:06,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-23 15:33:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1179, Unknown=30, NotChecked=380, Total=1806 [2023-11-23 15:33:06,938 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:33:09,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:11,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:15,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:24,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:27,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:32,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:34,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:36,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:40,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:42,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:45,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:47,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:49,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:53,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:56,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:33:58,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:34:00,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:34:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:34:03,160 INFO L93 Difference]: Finished difference Result 284 states and 327 transitions. [2023-11-23 15:34:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 15:34:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-23 15:34:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:34:03,161 INFO L225 Difference]: With dead ends: 284 [2023-11-23 15:34:03,161 INFO L226 Difference]: Without dead ends: 284 [2023-11-23 15:34:03,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=446, Invalid=2189, Unknown=37, NotChecked=520, Total=3192 [2023-11-23 15:34:03,162 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 324 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 49 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 2364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 915 IncrementalHoareTripleChecker+Unchecked, 39.9s IncrementalHoareTripleChecker+Time [2023-11-23 15:34:03,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 671 Invalid, 2364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1387 Invalid, 13 Unknown, 915 Unchecked, 39.9s Time] [2023-11-23 15:34:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-23 15:34:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 204. [2023-11-23 15:34:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.287292817679558) internal successors, (233), 202 states have internal predecessors, (233), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:34:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2023-11-23 15:34:03,166 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 37 [2023-11-23 15:34:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:34:03,166 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2023-11-23 15:34:03,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:34:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2023-11-23 15:34:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-23 15:34:03,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:34:03,167 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:34:03,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 15:34:03,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-23 15:34:03,375 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-23 15:34:03,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:34:03,375 INFO L85 PathProgramCache]: Analyzing trace with hash -520934286, now seen corresponding path program 2 times [2023-11-23 15:34:03,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:34:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801321768] [2023-11-23 15:34:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:34:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:34:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:34:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:34:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:34:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801321768] [2023-11-23 15:34:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801321768] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:34:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144126396] [2023-11-23 15:34:03,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:34:03,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:34:03,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:34:03,836 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:34:03,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 15:34:03,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:34:03,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:34:03,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 15:34:03,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:34:03,989 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 5 [2023-11-23 15:34:04,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:34:04,048 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 11 treesize of output 11 [2023-11-23 15:34:04,076 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 15 treesize of output 1 [2023-11-23 15:34:04,082 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-11-23 15:34:04,149 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 15:34:04,149 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 41 treesize of output 38 [2023-11-23 15:34:04,153 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 24 treesize of output 11 [2023-11-23 15:34:04,202 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-23 15:34:04,202 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 27 treesize of output 22 [2023-11-23 15:34:04,210 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 26 treesize of output 21 [2023-11-23 15:34:04,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:34:04,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:34:04,267 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:34:04,267 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 1 case distinctions, treesize of input 93 treesize of output 66 [2023-11-23 15:34:04,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 28 [2023-11-23 15:34:04,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:34:04,677 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:34:04,682 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-11-23 15:34:04,682 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2023-11-23 15:34:04,689 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 15:34:04,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 19 [2023-11-23 15:34:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:34:04,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:34:11,824 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_139| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1430))) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_138| Int) (v_ArrVal_1437 Int) (v_ArrVal_1436 Int)) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_137| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1431))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~end~0#1.offset_139| 8))) (or (= (select (let ((.cse0 (store .cse1 .cse2 (store (store (select .cse1 .cse2) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse3 v_ArrVal_1437)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|))) |v_ULTIMATE.start_main_~end~0#1.offset_137|) 0) (< (select (select (store .cse4 .cse2 (store (store (select .cse4 .cse2) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse3 v_ArrVal_1436)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|) |v_ULTIMATE.start_main_~end~0#1.offset_137|) (< |v_ULTIMATE.start_main_~end~0#1.offset_137| 0))))) (< |v_ULTIMATE.start_main_~end~0#1.offset_138| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_138|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) (< (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_139|)))) (forall ((v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_139| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1430))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) (< (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_139|) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_138| Int) (v_ArrVal_1437 Int) (v_ArrVal_1436 Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_138| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_138|) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_137| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1431))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse9 (+ |v_ULTIMATE.start_main_~end~0#1.offset_139| 8))) (let ((.cse6 (store .cse5 .cse8 (store (store (select .cse5 .cse8) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse9 v_ArrVal_1436)))) (or (< (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|) |v_ULTIMATE.start_main_~end~0#1.offset_137|) (= (select (select .cse6 (select (select (store .cse7 .cse8 (store (store (select .cse7 .cse8) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse9 v_ArrVal_1437)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|)) |v_ULTIMATE.start_main_~end~0#1.offset_137|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_137| 0)))))))))))) is different from false [2023-11-23 15:34:11,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_139| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1430))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_139|) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_138| Int) (v_ArrVal_1437 Int) (v_ArrVal_1436 Int)) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_137| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1431))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~end~0#1.offset_139| 8))) (let ((.cse1 (store .cse0 .cse3 (store (store (select .cse0 .cse3) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse4 v_ArrVal_1436)))) (or (= (select (select .cse1 (select (select (store .cse2 .cse3 (store (store (select .cse2 .cse3) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse4 v_ArrVal_1437)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|)) |v_ULTIMATE.start_main_~end~0#1.offset_137|) 0) (< (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|) |v_ULTIMATE.start_main_~end~0#1.offset_137|) (< |v_ULTIMATE.start_main_~end~0#1.offset_137| 0)))))) (< |v_ULTIMATE.start_main_~end~0#1.offset_138| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_138|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_139| 0)))) (forall ((v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_139| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1430))) (or (< (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_139|) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_138| Int) (v_ArrVal_1437 Int) (v_ArrVal_1436 Int)) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_137| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1431))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse10 (+ |v_ULTIMATE.start_main_~end~0#1.offset_139| 8))) (or (= (select (let ((.cse7 (store .cse8 .cse9 (store (store (select .cse8 .cse9) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse10 v_ArrVal_1437)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|))) |v_ULTIMATE.start_main_~end~0#1.offset_137|) 0) (< (select (select (store .cse6 .cse9 (store (store (select .cse6 .cse9) |v_ULTIMATE.start_main_~end~0#1.offset_139| 0) .cse10 v_ArrVal_1436)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_138|) |v_ULTIMATE.start_main_~end~0#1.offset_137|) (< |v_ULTIMATE.start_main_~end~0#1.offset_137| 0))))) (< |v_ULTIMATE.start_main_~end~0#1.offset_138| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_138|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_139| 0)))))) is different from false [2023-11-23 15:34:11,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:11,908 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 232 treesize of output 200 [2023-11-23 15:34:11,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:11,915 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 182 treesize of output 126 [2023-11-23 15:34:11,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:11,959 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 1929 treesize of output 1835 [2023-11-23 15:34:12,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:34:12,219 INFO L349 Elim1Store]: treesize reduction 96, result has 70.5 percent of original size [2023-11-23 15:34:12,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 6039 treesize of output 5753 [2023-11-23 15:34:12,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:12,377 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 7015 treesize of output 6415 [2023-11-23 15:34:12,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:12,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8239 treesize of output 8055 [2023-11-23 15:34:13,653 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 19 treesize of output 15 [2023-11-23 15:34:15,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:15,372 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 273 treesize of output 273 [2023-11-23 15:34:19,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:19,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2023-11-23 15:34:19,493 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:34:19,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2023-11-23 15:34:19,892 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 19 treesize of output 15 [2023-11-23 15:34:20,109 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 19 treesize of output 15 [2023-11-23 15:34:20,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 124 treesize of output 118 [2023-11-23 15:34:21,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 124 treesize of output 118 [2023-11-23 15:34:21,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 124 treesize of output 118 [2023-11-23 15:34:23,116 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 15:34:23,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 135 [2023-11-23 15:34:23,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 124 treesize of output 118 [2023-11-23 15:34:25,610 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 188 treesize of output 182 [2023-11-23 15:34:27,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:34:27,414 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 206 treesize of output 204 [2023-11-23 15:35:59,519 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 719 treesize of output 699 [2023-11-23 15:36:02,592 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 1724 treesize of output 1684 [2023-11-23 15:36:14,172 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 716 treesize of output 696 [2023-11-23 15:36:17,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:36:17,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:36:17,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 515 treesize of output 507 [2023-11-23 15:36:18,425 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 771 treesize of output 751 [2023-11-23 15:36:20,654 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 1521 treesize of output 1481 Killed by 15