./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 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-circular-2.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 16:29:32,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 16:29:32,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 16:29:32,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 16:29:32,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 16:29:32,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 16:29:32,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 16:29:32,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 16:29:32,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 16:29:32,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 16:29:32,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 16:29:32,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 16:29:32,590 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 16:29:32,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 16:29:32,592 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 16:29:32,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 16:29:32,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 16:29:32,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 16:29:32,592 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 16:29:32,592 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 16:29:32,593 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 16:29:32,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 16:29:32,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 16:29:32,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 16:29:32,594 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 16:29:32,594 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 16:29:32,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 16:29:32,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 16:29:32,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 16:29:32,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 16:29:32,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:29:32,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 16:29:32,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 16:29:32,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 16:29:32,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 16:29:32,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 16:29:32,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 16:29:32,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 16:29:32,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 16:29:32,597 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2023-11-22 16:29:32,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 16:29:32,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 16:29:32,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 16:29:32,848 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 16:29:32,849 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 16:29:32,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2023-11-22 16:29:33,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 16:29:34,008 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 16:29:34,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2023-11-22 16:29:34,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b111a1906/dab2d2834228420ebbdf9628a4649f6f/FLAG1aea253e4 [2023-11-22 16:29:34,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b111a1906/dab2d2834228420ebbdf9628a4649f6f [2023-11-22 16:29:34,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 16:29:34,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 16:29:34,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 16:29:34,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 16:29:34,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 16:29:34,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5357c028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34, skipping insertion in model container [2023-11-22 16:29:34,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,092 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 16:29:34,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:29:34,343 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 16:29:34,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:29:34,400 INFO L206 MainTranslator]: Completed translation [2023-11-22 16:29:34,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34 WrapperNode [2023-11-22 16:29:34,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 16:29:34,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 16:29:34,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 16:29:34,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 16:29:34,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,441 INFO L138 Inliner]: procedures = 119, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2023-11-22 16:29:34,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 16:29:34,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 16:29:34,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 16:29:34,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 16:29:34,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 16:29:34,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 16:29:34,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 16:29:34,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 16:29:34,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (1/1) ... [2023-11-22 16:29:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:29:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:34,506 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-22 16:29:34,520 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-22 16:29:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-22 16:29:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-22 16:29:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 16:29:34,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 16:29:34,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 16:29:34,629 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 16:29:34,630 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 16:29:34,917 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 16:29:34,977 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 16:29:34,978 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-22 16:29:34,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:29:34 BoogieIcfgContainer [2023-11-22 16:29:34,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 16:29:34,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 16:29:34,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 16:29:34,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 16:29:34,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:29:34" (1/3) ... [2023-11-22 16:29:34,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663117eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:29:34, skipping insertion in model container [2023-11-22 16:29:34,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:34" (2/3) ... [2023-11-22 16:29:34,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663117eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:29:34, skipping insertion in model container [2023-11-22 16:29:34,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:29:34" (3/3) ... [2023-11-22 16:29:34,985 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2023-11-22 16:29:34,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 16:29:34,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-11-22 16:29:35,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 16:29:35,036 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;@5428eeb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 16:29:35,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-22 16:29:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 99 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 16:29:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 16:29:35,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:35,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 16:29:35,046 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:35,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:35,051 INFO L85 PathProgramCache]: Analyzing trace with hash 8135, now seen corresponding path program 1 times [2023-11-22 16:29:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233751800] [2023-11-22 16:29:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:35,225 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-22 16:29:35,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:35,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233751800] [2023-11-22 16:29:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233751800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:35,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 16:29:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848865003] [2023-11-22 16:29:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:35,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:29:35,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:35,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:29:35,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:29:35,263 INFO L87 Difference]: Start difference. First operand has 104 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 99 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-22 16:29:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:35,379 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-11-22 16:29:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:29:35,381 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-22 16:29:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:35,387 INFO L225 Difference]: With dead ends: 104 [2023-11-22 16:29:35,387 INFO L226 Difference]: Without dead ends: 103 [2023-11-22 16:29:35,389 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-22 16:29:35,392 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 82 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:35,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 67 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-22 16:29:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2023-11-22 16:29:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 91 states have internal predecessors, (98), 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-22 16:29:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-11-22 16:29:35,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 2 [2023-11-22 16:29:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:35,420 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-11-22 16:29:35,420 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-22 16:29:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-11-22 16:29:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 16:29:35,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:35,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 16:29:35,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 16:29:35,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:35,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash 8136, now seen corresponding path program 1 times [2023-11-22 16:29:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:35,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250909072] [2023-11-22 16:29:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:35,500 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-22 16:29:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250909072] [2023-11-22 16:29:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250909072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:35,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:35,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 16:29:35,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132792941] [2023-11-22 16:29:35,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:35,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:29:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:29:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:29:35,505 INFO L87 Difference]: Start difference. First operand 93 states and 101 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-22 16:29:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:35,571 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-22 16:29:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:29:35,571 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-22 16:29:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:35,572 INFO L225 Difference]: With dead ends: 100 [2023-11-22 16:29:35,572 INFO L226 Difference]: Without dead ends: 100 [2023-11-22 16:29:35,573 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-22 16:29:35,576 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 79 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:35,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 70 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-22 16:29:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2023-11-22 16:29:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 2.066666666666667) internal successors, (93), 86 states have internal predecessors, (93), 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-22 16:29:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-11-22 16:29:35,594 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 2 [2023-11-22 16:29:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:35,595 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-11-22 16:29:35,595 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-22 16:29:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-11-22 16:29:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 16:29:35,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:35,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:35,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 16:29:35,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:35,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash 962070555, now seen corresponding path program 1 times [2023-11-22 16:29:35,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:35,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954208687] [2023-11-22 16:29:35,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:35,659 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-22 16:29:35,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:35,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954208687] [2023-11-22 16:29:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954208687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:35,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:35,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 16:29:35,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050875762] [2023-11-22 16:29:35,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:35,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 16:29:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 16:29:35,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:29:35,673 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-22 16:29:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:35,750 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-22 16:29:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:29:35,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-22 16:29:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:35,752 INFO L225 Difference]: With dead ends: 85 [2023-11-22 16:29:35,752 INFO L226 Difference]: Without dead ends: 85 [2023-11-22 16:29:35,753 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-22 16:29:35,759 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:35,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 47 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-22 16:29:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2023-11-22 16:29:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.8) internal successors, (81), 74 states have internal predecessors, (81), 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-22 16:29:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2023-11-22 16:29:35,768 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 7 [2023-11-22 16:29:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:35,769 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2023-11-22 16:29:35,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-22 16:29:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2023-11-22 16:29:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 16:29:35,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:35,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:35,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 16:29:35,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:35,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 962070556, now seen corresponding path program 1 times [2023-11-22 16:29:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:35,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344656123] [2023-11-22 16:29:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:35,876 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-22 16:29:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:35,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344656123] [2023-11-22 16:29:35,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344656123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:35,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:35,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:29:35,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372958006] [2023-11-22 16:29:35,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:35,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 16:29:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 16:29:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:29:35,878 INFO L87 Difference]: Start difference. First operand 76 states and 84 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-22 16:29:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:35,971 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2023-11-22 16:29:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 16:29:35,971 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-22 16:29:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:35,973 INFO L225 Difference]: With dead ends: 97 [2023-11-22 16:29:35,973 INFO L226 Difference]: Without dead ends: 97 [2023-11-22 16:29:35,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-22 16:29:35,981 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 83 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:35,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 85 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-22 16:29:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2023-11-22 16:29:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.75) internal successors, (91), 81 states have internal predecessors, (91), 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-22 16:29:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2023-11-22 16:29:35,994 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 7 [2023-11-22 16:29:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:35,994 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2023-11-22 16:29:35,995 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-22 16:29:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2023-11-22 16:29:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:29:35,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:35,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:35,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 16:29:35,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:35,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1132029993, now seen corresponding path program 1 times [2023-11-22 16:29:35,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:35,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736717391] [2023-11-22 16:29:35,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,114 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-22 16:29:36,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736717391] [2023-11-22 16:29:36,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736717391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:29:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773375541] [2023-11-22 16:29:36,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 16:29:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 16:29:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:29:36,118 INFO L87 Difference]: Start difference. First operand 83 states and 94 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-22 16:29:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:36,201 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2023-11-22 16:29:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:29:36,202 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-22 16:29:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:36,202 INFO L225 Difference]: With dead ends: 82 [2023-11-22 16:29:36,202 INFO L226 Difference]: Without dead ends: 82 [2023-11-22 16:29:36,203 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-22 16:29:36,203 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:36,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-22 16:29:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-22 16:29:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 80 states have internal predecessors, (89), 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-22 16:29:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2023-11-22 16:29:36,206 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 9 [2023-11-22 16:29:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:36,206 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2023-11-22 16:29:36,207 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-22 16:29:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2023-11-22 16:29:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:29:36,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:36,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:36,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 16:29:36,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:36,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1132029994, now seen corresponding path program 1 times [2023-11-22 16:29:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:36,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388412660] [2023-11-22 16:29:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:36,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,340 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-22 16:29:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388412660] [2023-11-22 16:29:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388412660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:29:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545992003] [2023-11-22 16:29:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 16:29:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 16:29:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:29:36,342 INFO L87 Difference]: Start difference. First operand 82 states and 92 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-22 16:29:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:36,425 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-22 16:29:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:29:36,425 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-22 16:29:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:36,426 INFO L225 Difference]: With dead ends: 81 [2023-11-22 16:29:36,426 INFO L226 Difference]: Without dead ends: 81 [2023-11-22 16:29:36,426 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-22 16:29:36,427 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:36,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-22 16:29:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-22 16:29:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 states have internal predecessors, (87), 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-22 16:29:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-11-22 16:29:36,430 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 9 [2023-11-22 16:29:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:36,430 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-11-22 16:29:36,430 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-22 16:29:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-11-22 16:29:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 16:29:36,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:36,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:36,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 16:29:36,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:36,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1114082243, now seen corresponding path program 1 times [2023-11-22 16:29:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618134750] [2023-11-22 16:29:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,583 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-22 16:29:36,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618134750] [2023-11-22 16:29:36,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618134750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:29:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390603943] [2023-11-22 16:29:36,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:29:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:29:36,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:29:36,586 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-22 16:29:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:36,719 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2023-11-22 16:29:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:29:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 12 [2023-11-22 16:29:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:36,720 INFO L225 Difference]: With dead ends: 154 [2023-11-22 16:29:36,720 INFO L226 Difference]: Without dead ends: 154 [2023-11-22 16:29:36,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-22 16:29:36,721 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 178 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:36,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 246 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-22 16:29:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 83. [2023-11-22 16:29:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 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-22 16:29:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2023-11-22 16:29:36,724 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 12 [2023-11-22 16:29:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:36,724 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2023-11-22 16:29:36,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-22 16:29:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2023-11-22 16:29:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:29:36,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:36,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:36,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 16:29:36,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:36,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1072441226, now seen corresponding path program 1 times [2023-11-22 16:29:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:36,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627361474] [2023-11-22 16:29:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,853 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-22 16:29:36,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627361474] [2023-11-22 16:29:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627361474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:29:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464703836] [2023-11-22 16:29:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:29:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:29:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:29:36,855 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-22 16:29:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:37,018 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-11-22 16:29:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 16:29:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-22 16:29:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:37,019 INFO L225 Difference]: With dead ends: 119 [2023-11-22 16:29:37,019 INFO L226 Difference]: Without dead ends: 119 [2023-11-22 16:29:37,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-22 16:29:37,021 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 277 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:37,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 138 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-22 16:29:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2023-11-22 16:29:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 96 states have internal predecessors, (119), 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-22 16:29:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2023-11-22 16:29:37,027 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 11 [2023-11-22 16:29:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:37,028 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2023-11-22 16:29:37,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-22 16:29:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2023-11-22 16:29:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:29:37,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:37,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:37,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 16:29:37,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:37,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1072441227, now seen corresponding path program 1 times [2023-11-22 16:29:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376560321] [2023-11-22 16:29:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:37,278 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-22 16:29:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376560321] [2023-11-22 16:29:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376560321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:37,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:29:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719876776] [2023-11-22 16:29:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:37,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:29:37,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:29:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:29:37,280 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-22 16:29:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:37,468 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2023-11-22 16:29:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 16:29:37,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-22 16:29:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:37,469 INFO L225 Difference]: With dead ends: 129 [2023-11-22 16:29:37,469 INFO L226 Difference]: Without dead ends: 129 [2023-11-22 16:29:37,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-22 16:29:37,471 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 175 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:37,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 164 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:29:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-22 16:29:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2023-11-22 16:29:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.605263157894737) internal successors, (122), 103 states have internal predecessors, (122), 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-22 16:29:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2023-11-22 16:29:37,480 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 11 [2023-11-22 16:29:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:37,480 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2023-11-22 16:29:37,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-22 16:29:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2023-11-22 16:29:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:29:37,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:37,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:37,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 16:29:37,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:37,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1254278380, now seen corresponding path program 1 times [2023-11-22 16:29:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756183039] [2023-11-22 16:29:37,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:37,603 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-22 16:29:37,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756183039] [2023-11-22 16:29:37,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756183039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:37,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:37,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 16:29:37,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130152350] [2023-11-22 16:29:37,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:37,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:29:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:29:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:29:37,605 INFO L87 Difference]: Start difference. First operand 105 states and 125 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-22 16:29:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:37,752 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2023-11-22 16:29:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 16:29:37,753 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-22 16:29:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:37,754 INFO L225 Difference]: With dead ends: 115 [2023-11-22 16:29:37,754 INFO L226 Difference]: Without dead ends: 115 [2023-11-22 16:29:37,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-22 16:29:37,754 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 143 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:37,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 111 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-22 16:29:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2023-11-22 16:29:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 102 states have internal predecessors, (121), 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-22 16:29:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2023-11-22 16:29:37,758 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 11 [2023-11-22 16:29:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:37,759 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2023-11-22 16:29:37,759 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-22 16:29:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2023-11-22 16:29:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:29:37,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:37,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:37,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 16:29:37,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:37,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1254278381, now seen corresponding path program 1 times [2023-11-22 16:29:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:37,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990225805] [2023-11-22 16:29:37,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:38,004 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-22 16:29:38,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990225805] [2023-11-22 16:29:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990225805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:38,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:38,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 16:29:38,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139152619] [2023-11-22 16:29:38,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:38,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 16:29:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:38,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 16:29:38,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 16:29:38,006 INFO L87 Difference]: Start difference. First operand 104 states and 124 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-22 16:29:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:38,226 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2023-11-22 16:29:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 16:29:38,226 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-22 16:29:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:38,227 INFO L225 Difference]: With dead ends: 109 [2023-11-22 16:29:38,227 INFO L226 Difference]: Without dead ends: 109 [2023-11-22 16:29:38,227 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-22 16:29:38,227 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 128 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:38,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 122 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-22 16:29:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2023-11-22 16:29:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 92 states have internal predecessors, (111), 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-22 16:29:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2023-11-22 16:29:38,230 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 11 [2023-11-22 16:29:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:38,230 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2023-11-22 16:29:38,230 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-22 16:29:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2023-11-22 16:29:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 16:29:38,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:38,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:38,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 16:29:38,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:38,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1165054726, now seen corresponding path program 1 times [2023-11-22 16:29:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:38,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418573713] [2023-11-22 16:29:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:38,426 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-22 16:29:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418573713] [2023-11-22 16:29:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418573713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:29:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216313928] [2023-11-22 16:29:38,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:38,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:29:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:38,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:29:38,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:29:38,428 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:38,610 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2023-11-22 16:29:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 16:29:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-22 16:29:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:38,612 INFO L225 Difference]: With dead ends: 124 [2023-11-22 16:29:38,612 INFO L226 Difference]: Without dead ends: 124 [2023-11-22 16:29:38,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-22 16:29:38,612 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 287 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:38,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 216 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-22 16:29:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2023-11-22 16:29:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 95 states have internal predecessors, (116), 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-22 16:29:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2023-11-22 16:29:38,615 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 14 [2023-11-22 16:29:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:38,615 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2023-11-22 16:29:38,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2023-11-22 16:29:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 16:29:38,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:38,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:38,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 16:29:38,616 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:38,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1165054725, now seen corresponding path program 1 times [2023-11-22 16:29:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072622363] [2023-11-22 16:29:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:38,819 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-22 16:29:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:38,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072622363] [2023-11-22 16:29:38,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072622363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:38,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:38,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:29:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994714559] [2023-11-22 16:29:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:38,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:29:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:29:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:29:38,821 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:38,997 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2023-11-22 16:29:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:29:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-22 16:29:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:38,998 INFO L225 Difference]: With dead ends: 134 [2023-11-22 16:29:38,998 INFO L226 Difference]: Without dead ends: 134 [2023-11-22 16:29:38,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-22 16:29:38,999 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 218 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:38,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 137 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-22 16:29:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 97. [2023-11-22 16:29:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 95 states have internal predecessors, (115), 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-22 16:29:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2023-11-22 16:29:39,003 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 14 [2023-11-22 16:29:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:39,003 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2023-11-22 16:29:39,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2023-11-22 16:29:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 16:29:39,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:39,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:39,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 16:29:39,005 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:39,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:39,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1631836334, now seen corresponding path program 1 times [2023-11-22 16:29:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:39,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540981999] [2023-11-22 16:29:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:39,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:39,122 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-22 16:29:39,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:39,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540981999] [2023-11-22 16:29:39,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540981999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:39,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:39,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 16:29:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935228971] [2023-11-22 16:29:39,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:39,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 16:29:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:39,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 16:29:39,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-22 16:29:39,125 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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-22 16:29:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:39,273 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2023-11-22 16:29:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:29:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 17 [2023-11-22 16:29:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:39,274 INFO L225 Difference]: With dead ends: 127 [2023-11-22 16:29:39,275 INFO L226 Difference]: Without dead ends: 127 [2023-11-22 16:29:39,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-22 16:29:39,275 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 95 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:39,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 217 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-22 16:29:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2023-11-22 16:29:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 105 states have internal predecessors, (128), 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-22 16:29:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2023-11-22 16:29:39,278 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 17 [2023-11-22 16:29:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:39,278 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2023-11-22 16:29:39,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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-22 16:29:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2023-11-22 16:29:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 16:29:39,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:39,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:39,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 16:29:39,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:39,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash -478805032, now seen corresponding path program 1 times [2023-11-22 16:29:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:39,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915507156] [2023-11-22 16:29:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:39,415 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-22 16:29:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915507156] [2023-11-22 16:29:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915507156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:39,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:29:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193821103] [2023-11-22 16:29:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:39,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:29:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:29:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:29:39,417 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-22 16:29:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:39,571 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2023-11-22 16:29:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:29:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-22 16:29:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:39,573 INFO L225 Difference]: With dead ends: 142 [2023-11-22 16:29:39,573 INFO L226 Difference]: Without dead ends: 142 [2023-11-22 16:29:39,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-22 16:29:39,575 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 138 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:39,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 212 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-22 16:29:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 110. [2023-11-22 16:29:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.5) internal successors, (132), 108 states have internal predecessors, (132), 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-22 16:29:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2023-11-22 16:29:39,579 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 17 [2023-11-22 16:29:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:39,579 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2023-11-22 16:29:39,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-22 16:29:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2023-11-22 16:29:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 16:29:39,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:39,581 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-22 16:29:39,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 16:29:39,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:39,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1957976375, now seen corresponding path program 1 times [2023-11-22 16:29:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341499084] [2023-11-22 16:29:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:39,697 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-22 16:29:39,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341499084] [2023-11-22 16:29:39,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341499084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:39,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:39,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:29:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189624931] [2023-11-22 16:29:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:39,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:29:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:29:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:29:39,699 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) 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-22 16:29:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:39,807 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2023-11-22 16:29:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 16:29:39,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-22 16:29:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:39,808 INFO L225 Difference]: With dead ends: 148 [2023-11-22 16:29:39,808 INFO L226 Difference]: Without dead ends: 148 [2023-11-22 16:29:39,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-22 16:29:39,809 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 352 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:39,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 138 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-22 16:29:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2023-11-22 16:29:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 111 states have internal predecessors, (135), 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-22 16:29:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2023-11-22 16:29:39,812 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 18 [2023-11-22 16:29:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:39,812 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2023-11-22 16:29:39,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-22 16:29:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2023-11-22 16:29:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 16:29:39,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:39,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] [2023-11-22 16:29:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 16:29:39,813 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:39,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1993144411, now seen corresponding path program 1 times [2023-11-22 16:29:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:39,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666777691] [2023-11-22 16:29:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:39,849 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-22 16:29:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666777691] [2023-11-22 16:29:39,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666777691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:39,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:39,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 16:29:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049610523] [2023-11-22 16:29:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:39,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:29:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:39,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:29:39,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:29:39,851 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-22 16:29:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:39,865 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2023-11-22 16:29:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:29:39,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2023-11-22 16:29:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:39,866 INFO L225 Difference]: With dead ends: 115 [2023-11-22 16:29:39,866 INFO L226 Difference]: Without dead ends: 115 [2023-11-22 16:29:39,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 16:29:39,867 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:39,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 16:29:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-22 16:29:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-22 16:29:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 113 states have internal predecessors, (137), 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-22 16:29:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2023-11-22 16:29:39,869 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 19 [2023-11-22 16:29:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:39,869 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2023-11-22 16:29:39,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-22 16:29:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2023-11-22 16:29:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 16:29:39,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:39,870 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-22 16:29:39,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 16:29:39,870 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:39,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1311265942, now seen corresponding path program 1 times [2023-11-22 16:29:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:39,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828521229] [2023-11-22 16:29:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:40,041 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-22 16:29:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828521229] [2023-11-22 16:29:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828521229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:40,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:40,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:29:40,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860110700] [2023-11-22 16:29:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:40,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:29:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:29:40,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:29:40,043 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) 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-22 16:29:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:40,240 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2023-11-22 16:29:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 16:29:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-22 16:29:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:40,240 INFO L225 Difference]: With dead ends: 135 [2023-11-22 16:29:40,240 INFO L226 Difference]: Without dead ends: 135 [2023-11-22 16:29:40,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-22 16:29:40,241 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 245 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:40,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 230 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-22 16:29:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2023-11-22 16:29:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 117 states have internal predecessors, (143), 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-22 16:29:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2023-11-22 16:29:40,243 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 18 [2023-11-22 16:29:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:40,243 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2023-11-22 16:29:40,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) 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-22 16:29:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2023-11-22 16:29:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 16:29:40,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:40,244 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-22 16:29:40,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-22 16:29:40,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:40,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1311265943, now seen corresponding path program 1 times [2023-11-22 16:29:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901810499] [2023-11-22 16:29:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:40,466 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-22 16:29:40,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901810499] [2023-11-22 16:29:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901810499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:40,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:40,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:29:40,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206712259] [2023-11-22 16:29:40,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:40,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:29:40,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:40,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:29:40,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:29:40,469 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-22 16:29:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:40,629 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2023-11-22 16:29:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:29:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-22 16:29:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:40,631 INFO L225 Difference]: With dead ends: 145 [2023-11-22 16:29:40,631 INFO L226 Difference]: Without dead ends: 145 [2023-11-22 16:29:40,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-22 16:29:40,632 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 195 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:40,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 142 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-22 16:29:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2023-11-22 16:29:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 117 states have internal predecessors, (142), 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-22 16:29:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2023-11-22 16:29:40,634 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 18 [2023-11-22 16:29:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:40,634 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2023-11-22 16:29:40,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-22 16:29:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2023-11-22 16:29:40,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 16:29:40,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:40,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:40,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-22 16:29:40,636 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:40,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash -570127397, now seen corresponding path program 1 times [2023-11-22 16:29:40,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:40,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283439866] [2023-11-22 16:29:40,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:40,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:40,787 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-22 16:29:40,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283439866] [2023-11-22 16:29:40,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283439866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:40,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:40,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:29:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124733632] [2023-11-22 16:29:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:29:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:29:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:29:40,789 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-22 16:29:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:40,946 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2023-11-22 16:29:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:29:40,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-22 16:29:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:40,947 INFO L225 Difference]: With dead ends: 133 [2023-11-22 16:29:40,947 INFO L226 Difference]: Without dead ends: 129 [2023-11-22 16:29:40,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-22 16:29:40,948 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:40,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 200 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-22 16:29:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2023-11-22 16:29:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 115 states have internal predecessors, (139), 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-22 16:29:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2023-11-22 16:29:40,951 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 19 [2023-11-22 16:29:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:40,951 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2023-11-22 16:29:40,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-22 16:29:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2023-11-22 16:29:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 16:29:40,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:40,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:40,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-22 16:29:40,953 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:40,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1993217749, now seen corresponding path program 1 times [2023-11-22 16:29:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084375058] [2023-11-22 16:29:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:40,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:41,122 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-22 16:29:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084375058] [2023-11-22 16:29:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084375058] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:29:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442959848] [2023-11-22 16:29:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:41,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:29:41,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:41,124 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-22 16:29:41,153 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-22 16:29:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:41,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-22 16:29:41,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:29:41,276 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-22 16:29:41,325 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-22 16:29:41,328 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-22 16:29:41,353 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-22 16:29:41,363 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-22 16:29:41,397 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-22 16:29:41,407 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-22 16:29:41,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:41,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:41,477 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 34 treesize of output 21 [2023-11-22 16:29:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:41,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:41,486 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 34 treesize of output 21 [2023-11-22 16:29:41,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-22 16:29:41,704 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-22 16:29:41,705 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 16 [2023-11-22 16:29:41,708 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-22 16:29:41,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:29:41,781 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_73| Int) (v_ArrVal_562 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_73|) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 v_ArrVal_563)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_73|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_73| 0) (not (= v_ArrVal_562 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 (select v_ArrVal_562 .cse1))))))) is different from false [2023-11-22 16:29:46,126 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 119 treesize of output 117 [2023-11-22 16:29:46,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:46,147 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 18556 treesize of output 17183 [2023-11-22 16:29:47,450 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 7 treesize of output 5 [2023-11-22 16:29:47,465 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-22 16:29:47,469 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-22 16:29:47,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:47,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:47,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-22 16:29:47,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:47,503 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 96 treesize of output 115 [2023-11-22 16:29:47,512 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 655 treesize of output 647 [2023-11-22 16:29:47,557 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-22 16:29:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442959848] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 16:29:47,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 16:29:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2023-11-22 16:29:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705513353] [2023-11-22 16:29:47,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 16:29:47,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 16:29:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:47,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 16:29:47,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=274, Unknown=3, NotChecked=34, Total=380 [2023-11-22 16:29:47,561 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 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-22 16:29:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:48,099 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2023-11-22 16:29:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 16:29:48,100 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 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 19 [2023-11-22 16:29:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:48,100 INFO L225 Difference]: With dead ends: 141 [2023-11-22 16:29:48,100 INFO L226 Difference]: Without dead ends: 141 [2023-11-22 16:29:48,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=186, Invalid=571, Unknown=3, NotChecked=52, Total=812 [2023-11-22 16:29:48,101 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 518 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:48,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 254 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 426 Invalid, 0 Unknown, 123 Unchecked, 0.4s Time] [2023-11-22 16:29:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-22 16:29:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2023-11-22 16:29:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 115 states have internal predecessors, (138), 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-22 16:29:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2023-11-22 16:29:48,103 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 19 [2023-11-22 16:29:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:48,103 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2023-11-22 16:29:48,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 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-22 16:29:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2023-11-22 16:29:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 16:29:48,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:48,104 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-22 16:29:48,123 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-22 16:29:48,308 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,SelfDestructingSolverStorable20 [2023-11-22 16:29:48,308 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:48,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -887841195, now seen corresponding path program 1 times [2023-11-22 16:29:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380245875] [2023-11-22 16:29:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:48,332 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-22 16:29:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380245875] [2023-11-22 16:29:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380245875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 16:29:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893663419] [2023-11-22 16:29:48,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:48,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:29:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:48,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:29:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:29:48,334 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-22 16:29:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:48,362 INFO L93 Difference]: Finished difference Result 178 states and 207 transitions. [2023-11-22 16:29:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:29:48,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-22 16:29:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:48,365 INFO L225 Difference]: With dead ends: 178 [2023-11-22 16:29:48,365 INFO L226 Difference]: Without dead ends: 178 [2023-11-22 16:29:48,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 16:29:48,366 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 54 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:48,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 16:29:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-22 16:29:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 130. [2023-11-22 16:29:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 128 states have internal predecessors, (152), 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-22 16:29:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2023-11-22 16:29:48,368 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 20 [2023-11-22 16:29:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:48,369 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2023-11-22 16:29:48,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-22 16:29:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2023-11-22 16:29:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 16:29:48,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:48,369 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-22 16:29:48,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-22 16:29:48,369 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:48,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -419613350, now seen corresponding path program 1 times [2023-11-22 16:29:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591205595] [2023-11-22 16:29:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:29:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:48,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591205595] [2023-11-22 16:29:48,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591205595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:48,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:48,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 16:29:48,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559508902] [2023-11-22 16:29:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:48,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 16:29:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:48,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 16:29:48,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-22 16:29:48,569 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:48,760 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2023-11-22 16:29:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 16:29:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-22 16:29:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:48,761 INFO L225 Difference]: With dead ends: 143 [2023-11-22 16:29:48,761 INFO L226 Difference]: Without dead ends: 140 [2023-11-22 16:29:48,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-22 16:29:48,762 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 127 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:48,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 307 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-22 16:29:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2023-11-22 16:29:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 128 states have internal predecessors, (151), 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-22 16:29:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2023-11-22 16:29:48,764 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 20 [2023-11-22 16:29:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:48,764 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2023-11-22 16:29:48,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2023-11-22 16:29:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 16:29:48,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:48,764 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] [2023-11-22 16:29:48,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-22 16:29:48,765 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:48,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1502679585, now seen corresponding path program 1 times [2023-11-22 16:29:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422144426] [2023-11-22 16:29:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:49,062 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-22 16:29:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:49,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422144426] [2023-11-22 16:29:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422144426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 16:29:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053008380] [2023-11-22 16:29:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 16:29:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 16:29:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 16:29:49,064 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-22 16:29:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:49,272 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2023-11-22 16:29:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 16:29:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2023-11-22 16:29:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:49,272 INFO L225 Difference]: With dead ends: 141 [2023-11-22 16:29:49,273 INFO L226 Difference]: Without dead ends: 141 [2023-11-22 16:29:49,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-11-22 16:29:49,273 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 158 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:49,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 261 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-22 16:29:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2023-11-22 16:29:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 127 states have internal predecessors, (149), 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-22 16:29:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2023-11-22 16:29:49,275 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 22 [2023-11-22 16:29:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:49,275 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2023-11-22 16:29:49,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-22 16:29:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2023-11-22 16:29:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 16:29:49,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:49,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:49,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-22 16:29:49,276 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:49,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2027189711, now seen corresponding path program 1 times [2023-11-22 16:29:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869375054] [2023-11-22 16:29:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:49,480 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-22 16:29:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869375054] [2023-11-22 16:29:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869375054] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:29:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807543648] [2023-11-22 16:29:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:49,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:29:49,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:49,482 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-22 16:29:49,512 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-22 16:29:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:49,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-22 16:29:49,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:29:49,570 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-22 16:29:49,573 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-22 16:29:49,589 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-22 16:29:49,595 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-22 16:29:49,626 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-22 16:29:49,632 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-22 16:29:49,683 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 8 treesize of output 1 [2023-11-22 16:29:49,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:49,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:49,689 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 34 treesize of output 21 [2023-11-22 16:29:49,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:49,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:49,694 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 34 treesize of output 21 [2023-11-22 16:29:49,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:49,967 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-22 16:29:49,967 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 36 [2023-11-22 16:29:49,976 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2023-11-22 16:29:49,977 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 3 case distinctions, treesize of input 42 treesize of output 25 [2023-11-22 16:29:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:29:50,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:29:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:29:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807543648] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 16:29:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:29:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 11] total 22 [2023-11-22 16:29:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796904155] [2023-11-22 16:29:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:50,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:29:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:29:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2023-11-22 16:29:50,093 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:50,224 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2023-11-22 16:29:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 16:29:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-22 16:29:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:50,225 INFO L225 Difference]: With dead ends: 143 [2023-11-22 16:29:50,225 INFO L226 Difference]: Without dead ends: 143 [2023-11-22 16:29:50,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2023-11-22 16:29:50,225 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:50,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 182 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-22 16:29:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2023-11-22 16:29:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 136 states have internal predecessors, (161), 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-22 16:29:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2023-11-22 16:29:50,227 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 22 [2023-11-22 16:29:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:50,227 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2023-11-22 16:29:50,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2023-11-22 16:29:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 16:29:50,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:50,228 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] [2023-11-22 16:29:50,241 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-22 16:29:50,428 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,SelfDestructingSolverStorable24 [2023-11-22 16:29:50,428 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:50,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash -665201756, now seen corresponding path program 1 times [2023-11-22 16:29:50,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:50,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695386719] [2023-11-22 16:29:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:50,631 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-22 16:29:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695386719] [2023-11-22 16:29:50,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695386719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:29:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919807836] [2023-11-22 16:29:50,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:29:50,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:50,633 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-22 16:29:50,656 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-22 16:29:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:50,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-22 16:29:50,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:29:50,730 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-22 16:29:50,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 16:29:50,746 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-22 16:29:50,762 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-22 16:29:50,767 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-22 16:29:50,804 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:29:50,805 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-22 16:29:50,808 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-22 16:29:50,816 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 15 treesize of output 7 [2023-11-22 16:29:50,835 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 16:29:50,836 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 24 treesize of output 17 [2023-11-22 16:29:50,850 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-22 16:29:50,884 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:29:50,884 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 33 treesize of output 32 [2023-11-22 16:29:50,904 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 24 treesize of output 12 [2023-11-22 16:29:50,907 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-22 16:29:50,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:29:50,912 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_839 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-11-22 16:29:51,022 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_835 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_839 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_839)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) (or (forall ((v_ArrVal_835 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_839 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_836))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select (select (store .cse1 .cse2 v_ArrVal_839) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (= .cse2 0))))))) is different from false [2023-11-22 16:29:51,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:51,087 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 131 treesize of output 100 [2023-11-22 16:29:51,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:51,099 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 417 treesize of output 372 [2023-11-22 16:29:51,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:51,119 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 218 treesize of output 217 [2023-11-22 16:29:51,124 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 208 treesize of output 204 [2023-11-22 16:29:51,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:51,140 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 204 treesize of output 197 [2023-11-22 16:29:51,148 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 218 treesize of output 206 [2023-11-22 16:29:51,155 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 206 treesize of output 200 [2023-11-22 16:29:51,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:51,165 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 200 treesize of output 201 [2023-11-22 16:29:51,171 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 192 treesize of output 190 [2023-11-22 16:29:51,177 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 190 treesize of output 188 [2023-11-22 16:29:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 16:29:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919807836] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 16:29:51,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 16:29:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2023-11-22 16:29:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143733592] [2023-11-22 16:29:51,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 16:29:51,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-22 16:29:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-22 16:29:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=466, Unknown=10, NotChecked=90, Total=650 [2023-11-22 16:29:51,576 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 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-22 16:29:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:52,329 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2023-11-22 16:29:52,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 16:29:52,330 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 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-22 16:29:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:52,331 INFO L225 Difference]: With dead ends: 234 [2023-11-22 16:29:52,331 INFO L226 Difference]: Without dead ends: 234 [2023-11-22 16:29:52,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=874, Unknown=10, NotChecked=126, Total=1190 [2023-11-22 16:29:52,332 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 399 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:52,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 570 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1012 Invalid, 0 Unknown, 339 Unchecked, 0.6s Time] [2023-11-22 16:29:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-22 16:29:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 147. [2023-11-22 16:29:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.376) internal successors, (172), 145 states have internal predecessors, (172), 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-22 16:29:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2023-11-22 16:29:52,335 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 23 [2023-11-22 16:29:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:52,335 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2023-11-22 16:29:52,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 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-22 16:29:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2023-11-22 16:29:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 16:29:52,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:52,336 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] [2023-11-22 16:29:52,349 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-22 16:29:52,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:29:52,537 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:52,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1822572733, now seen corresponding path program 1 times [2023-11-22 16:29:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37601898] [2023-11-22 16:29:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:52,722 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-22 16:29:52,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:52,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37601898] [2023-11-22 16:29:52,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37601898] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:29:52,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339027837] [2023-11-22 16:29:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:52,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:29:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:52,724 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-22 16:29:52,725 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-22 16:29:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:52,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-22 16:29:52,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:29:52,825 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-22 16:29:52,849 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 16:29:52,850 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-22 16:29:52,874 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-22 16:29:52,948 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:29:52,948 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-22 16:29:52,984 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 16:29:52,985 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-22 16:29:53,010 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 16:29:53,011 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-22 16:29:53,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:29:53,056 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-22 16:29:53,075 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-22 16:29:53,106 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-22 16:29:53,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:29:53,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:53,239 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-22 16:29:53,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:53,251 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 144 treesize of output 131 [2023-11-22 16:29:53,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:53,264 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 80 treesize of output 78 [2023-11-22 16:29:53,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 70 treesize of output 66 [2023-11-22 16:29:53,923 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-22 16:29:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339027837] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 16:29:53,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 16:29:53,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 23 [2023-11-22 16:29:53,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668537933] [2023-11-22 16:29:53,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 16:29:53,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-22 16:29:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-22 16:29:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=419, Unknown=31, NotChecked=0, Total=552 [2023-11-22 16:29:53,925 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 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-22 16:29:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:54,756 INFO L93 Difference]: Finished difference Result 255 states and 298 transitions. [2023-11-22 16:29:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 16:29:54,756 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 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 22 [2023-11-22 16:29:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:54,765 INFO L225 Difference]: With dead ends: 255 [2023-11-22 16:29:54,765 INFO L226 Difference]: Without dead ends: 255 [2023-11-22 16:29:54,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=913, Unknown=44, NotChecked=0, Total=1190 [2023-11-22 16:29:54,766 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 400 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:54,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 526 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 16:29:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-22 16:29:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 167. [2023-11-22 16:29:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.4482758620689655) internal successors, (210), 165 states have internal predecessors, (210), 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-22 16:29:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2023-11-22 16:29:54,771 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 22 [2023-11-22 16:29:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:54,771 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2023-11-22 16:29:54,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 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-22 16:29:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2023-11-22 16:29:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 16:29:54,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:54,772 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] [2023-11-22 16:29:54,784 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-22 16:29:54,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-22 16:29:54,982 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:54,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1822572732, now seen corresponding path program 1 times [2023-11-22 16:29:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:54,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349595251] [2023-11-22 16:29:54,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:55,257 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-22 16:29:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349595251] [2023-11-22 16:29:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349595251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:29:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025356648] [2023-11-22 16:29:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:29:55,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:55,259 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-22 16:29:55,261 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-22 16:29:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:55,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-22 16:29:55,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:29:55,367 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-22 16:29:55,387 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 16:29:55,388 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-22 16:29:55,392 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-22 16:29:55,410 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-22 16:29:55,416 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-22 16:29:55,469 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:29:55,470 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-22 16:29:55,475 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-22 16:29:55,517 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 16:29:55,517 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-22 16:29:55,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:55,524 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-22 16:29:55,542 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-22 16:29:55,542 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-22 16:29:55,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:55,551 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-22 16:29:55,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:29:55,586 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-22 16:29:55,591 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-22 16:29:55,616 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-22 16:29:55,620 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-22 16:29:55,637 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-22 16:29:55,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:29:55,701 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1067 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-22 16:29:55,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1067 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-22 16:29:55,756 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1062))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1061) .cse0 v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1061) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1062) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-22 16:29:55,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1062))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1061) .cse1 v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1068) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1061) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1062) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1067) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-22 16:29:55,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:55,774 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-22 16:29:55,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:55,779 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-22 16:29:55,781 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 54 treesize of output 46 [2023-11-22 16:29:55,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:55,789 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 112 treesize of output 111 [2023-11-22 16:29:55,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 68 treesize of output 60 [2023-11-22 16:29:55,797 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 88 treesize of output 82 [2023-11-22 16:29:55,801 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 56 treesize of output 54 [2023-11-22 16:29:55,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:55,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-11-22 16:29:55,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:55,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-11-22 16:29:55,847 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:55,847 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:55,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-11-22 16:29:55,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:55,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-22 16:29:55,856 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-22 16:29:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-22 16:29:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025356648] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 16:29:55,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 16:29:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2023-11-22 16:29:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118825873] [2023-11-22 16:29:55,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 16:29:55,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 16:29:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 16:29:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=358, Unknown=4, NotChecked=164, Total=600 [2023-11-22 16:29:55,937 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 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-22 16:29:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:56,632 INFO L93 Difference]: Finished difference Result 223 states and 261 transitions. [2023-11-22 16:29:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 16:29:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 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 22 [2023-11-22 16:29:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:56,634 INFO L225 Difference]: With dead ends: 223 [2023-11-22 16:29:56,634 INFO L226 Difference]: Without dead ends: 223 [2023-11-22 16:29:56,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=758, Unknown=4, NotChecked=244, Total=1190 [2023-11-22 16:29:56,635 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 337 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 645 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:56,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 337 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 757 Invalid, 0 Unknown, 645 Unchecked, 0.4s Time] [2023-11-22 16:29:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-22 16:29:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 181. [2023-11-22 16:29:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.43125) internal successors, (229), 179 states have internal predecessors, (229), 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-22 16:29:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 232 transitions. [2023-11-22 16:29:56,639 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 232 transitions. Word has length 22 [2023-11-22 16:29:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:56,639 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 232 transitions. [2023-11-22 16:29:56,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 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-22 16:29:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 232 transitions. [2023-11-22 16:29:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 16:29:56,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:56,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:29:56,653 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-22 16:29:56,851 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,SelfDestructingSolverStorable27 [2023-11-22 16:29:56,852 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:29:56,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1993449013, now seen corresponding path program 1 times [2023-11-22 16:29:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406844491] [2023-11-22 16:29:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:57,042 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-22 16:29:57,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406844491] [2023-11-22 16:29:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406844491] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:29:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936683353] [2023-11-22 16:29:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:29:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:57,044 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-22 16:29:57,045 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-22 16:29:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:57,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-22 16:29:57,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:29:57,153 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-22 16:29:57,166 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-22 16:29:57,169 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-22 16:29:57,191 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-22 16:29:57,197 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-22 16:29:57,254 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-22 16:29:57,261 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-22 16:29:57,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:57,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:57,327 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 34 treesize of output 21 [2023-11-22 16:29:57,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:57,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:29:57,331 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 34 treesize of output 21 [2023-11-22 16:29:57,546 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-11-22 16:29:57,601 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-11-22 16:29:57,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 22 [2023-11-22 16:29:57,603 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-22 16:29:57,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:29:57,703 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 Int) (v_ArrVal_1129 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1129)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) (< |v_ULTIMATE.start_main_~x~0#1.offset_89| 0) (not (= (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 (select v_ArrVal_1129 .cse1)) v_ArrVal_1129)) (= (select |c_#valid| (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 v_ArrVal_1130)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse2 (select (select .cse2 .cse3) |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (select (select .cse0 .cse3) |v_ULTIMATE.start_main_~x~0#1.offset_89|))))) 1)))) is different from false [2023-11-22 16:29:57,771 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_89| 0) (= (select |c_#valid| (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1130)))) (select .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1129) .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_89|)))) 1) (not (= v_ArrVal_1129 (store .cse4 .cse3 (select v_ArrVal_1129 .cse3)))) (< (select v_ArrVal_1129 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (forall ((v_ArrVal_1130 Int) (v_ArrVal_1129 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (let ((.cse5 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_90|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_90| |c_ULTIMATE.start_main_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~x~0#1.offset_89| 0) (not (= (store (store .cse4 .cse3 (select v_ArrVal_1129 .cse3)) .cse5 (select v_ArrVal_1129 .cse5)) v_ArrVal_1129)) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (= (select |c_#valid| (let ((.cse8 (store (store .cse2 .cse3 v_DerPreprocessor_6) .cse5 v_ArrVal_1130))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse8))) (select .cse6 (select (select .cse6 .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1129) .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_89|))))) 1) (< (select v_ArrVal_1129 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_89|)))))) is different from false [2023-11-22 16:29:57,813 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse6 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse10 0)) (.cse3 (store .cse9 .cse10 0)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1130 Int) (v_ArrVal_1129 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (let ((.cse5 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_90|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_90| |c_ULTIMATE.start_main_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~x~0#1.offset_89| 0) (= (select |c_#valid| (let ((.cse2 (store (store .cse3 .cse4 v_DerPreprocessor_6) .cse5 v_ArrVal_1130))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse2))) (select .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1129) .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_89|))))) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (not (= (store (store .cse6 .cse4 (select v_ArrVal_1129 .cse4)) .cse5 (select v_ArrVal_1129 .cse5)) v_ArrVal_1129)) (< (select v_ArrVal_1129 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_89|)))) (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (not (= (store .cse6 .cse4 (select v_ArrVal_1129 .cse4)) v_ArrVal_1129)) (< |v_ULTIMATE.start_main_~x~0#1.offset_89| 0) (= (select |c_#valid| (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_1130)))) (select .cse7 (select (select .cse7 .cse8) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1129) .cse8) |v_ULTIMATE.start_main_~x~0#1.offset_89|)))) 1) (< (select v_ArrVal_1129 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_89|)))))) is different from false [2023-11-22 16:29:57,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:57,833 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1022 treesize of output 951 [2023-11-22 16:29:57,854 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 339 treesize of output 323 [2023-11-22 16:29:57,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:57,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:57,861 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 272 treesize of output 256 [2023-11-22 16:29:57,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:57,874 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 24 treesize of output 28 [2023-11-22 16:29:57,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:57,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:57,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:29:57,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 170 [2023-11-22 16:29:58,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:58,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:58,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:29:58,213 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-22 16:29:58,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 550528 treesize of output 422886 [2023-11-22 16:30:00,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:30:00,184 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 4605 treesize of output 4603 [2023-11-22 16:30:00,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:30:00,314 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:30:00,319 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 69287 treesize of output 68855 [2023-11-22 16:30:02,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:30:02,885 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 3 case distinctions, treesize of input 7842 treesize of output 7682 [2023-11-22 16:30:18,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:30:18,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:30:18,560 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 497 treesize of output 483 [2023-11-22 16:30:19,174 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-22 16:30:19,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936683353] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 16:30:19,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 16:30:19,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 20 [2023-11-22 16:30:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768007872] [2023-11-22 16:30:19,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 16:30:19,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-22 16:30:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:30:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-22 16:30:19,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=277, Unknown=3, NotChecked=108, Total=462 [2023-11-22 16:30:19,176 INFO L87 Difference]: Start difference. First operand 181 states and 232 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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-22 16:30:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:30:19,617 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2023-11-22 16:30:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 16:30:19,618 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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-22 16:30:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:30:19,619 INFO L225 Difference]: With dead ends: 204 [2023-11-22 16:30:19,619 INFO L226 Difference]: Without dead ends: 204 [2023-11-22 16:30:19,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=492, Unknown=3, NotChecked=150, Total=812 [2023-11-22 16:30:19,619 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 295 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 16:30:19,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 289 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 399 Invalid, 0 Unknown, 359 Unchecked, 0.3s Time] [2023-11-22 16:30:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-22 16:30:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 181. [2023-11-22 16:30:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.425) internal successors, (228), 179 states have internal predecessors, (228), 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-22 16:30:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2023-11-22 16:30:19,622 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 25 [2023-11-22 16:30:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:30:19,622 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2023-11-22 16:30:19,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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-22 16:30:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2023-11-22 16:30:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 16:30:19,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:30:19,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:30:19,636 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-22 16:30:19,833 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,SelfDestructingSolverStorable28 [2023-11-22 16:30:19,835 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:30:19,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:30:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1993449012, now seen corresponding path program 1 times [2023-11-22 16:30:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:30:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102298402] [2023-11-22 16:30:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:30:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:30:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:30:20,131 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-22 16:30:20,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:30:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102298402] [2023-11-22 16:30:20,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102298402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:30:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262674911] [2023-11-22 16:30:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:30:20,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:30:20,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:30:20,149 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-22 16:30:20,150 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-22 16:30:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:30:20,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-22 16:30:20,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:30:20,270 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 8 treesize of output 1 [2023-11-22 16:30:20,275 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-22 16:30:20,279 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-22 16:30:20,297 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-22 16:30:20,302 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-22 16:30:20,336 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-22 16:30:20,346 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-22 16:30:20,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:30:20,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:30:20,404 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 34 treesize of output 21 [2023-11-22 16:30:20,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:30:20,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:30:20,410 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 34 treesize of output 21 [2023-11-22 16:30:20,716 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-22 16:30:20,717 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 23 [2023-11-22 16:30:20,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 16:30:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:30:20,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:30:20,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1192 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1192))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_ArrVal_1192 (store .cse0 .cse1 (select v_ArrVal_1192 .cse1)))) (< .cse2 0) (forall ((v_ArrVal_1193 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse1 v_ArrVal_1193)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse4 (select (select .cse6 .cse7) .cse2)) (.cse5 (select (select .cse3 .cse7) .cse2))) (<= (+ (select (select .cse3 .cse4) .cse5) 12) (select |c_#length| (select (select .cse6 .cse4) .cse5))))))))))) (forall ((v_ArrVal_1192 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1192))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (forall ((v_ArrVal_1193 Int)) (<= 0 (+ (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 .cse1 v_ArrVal_1193)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse9 (select (select .cse10 .cse11) .cse12)) (select (select .cse9 .cse11) .cse12)))) 8))) (not (= v_ArrVal_1192 (store .cse0 .cse1 (select v_ArrVal_1192 .cse1)))) (< .cse12 0))))))) is different from false [2023-11-22 16:30:25,178 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse25 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse4 (select .cse25 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse6 (store .cse25 .cse24 0)) (.cse8 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse24 0)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1193 Int)) (let ((.cse5 (select v_ArrVal_1192 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1192)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 .cse7 v_ArrVal_1193)))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (select (select .cse0 .cse4) .cse5))) (< (+ (select (select .cse0 .cse1) .cse2) 11) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (= v_ArrVal_1192 (store .cse8 .cse7 (select v_ArrVal_1192 .cse7)))) (< .cse5 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_94| Int)) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_94|) (< |v_ULTIMATE.start_main_~x~0#1.offset_94| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1193 Int) (v_DerPreprocessor_11 Int)) (let ((.cse16 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_94|)) (.cse14 (select v_ArrVal_1192 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse15 (store (store .cse6 .cse7 v_DerPreprocessor_11) .cse16 v_ArrVal_1193))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1192)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse15)) (.cse13 (select .cse15 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse10 (select (select .cse12 .cse13) .cse14)) (.cse11 (select (select .cse9 .cse13) .cse14))) (< (+ (select (select .cse9 .cse10) .cse11) 11) (select |c_#length| (select (select .cse12 .cse10) .cse11)))))) (not (= (store (store .cse8 .cse7 (select v_ArrVal_1192 .cse7)) .cse16 (select v_ArrVal_1192 .cse16)) v_ArrVal_1192)) (< .cse14 0)))))) (forall ((v_prenex_18 Int) (v_prenex_17 (Array Int Int))) (let ((.cse18 (select v_prenex_17 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (store .cse8 .cse7 (select v_prenex_17 .cse7)) v_prenex_17)) (< 0 (+ 9 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_prenex_17))) (select (select .cse17 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 .cse7 v_prenex_18)) .cse4) .cse18)) (select (select .cse17 .cse4) .cse18))))) (< .cse18 0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_94| Int)) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_94|) (forall ((v_DerPreprocessor_11 Int) (v_prenex_18 Int) (v_prenex_17 (Array Int Int))) (let ((.cse23 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_94|)) (.cse22 (select v_prenex_17 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< 0 (+ (let ((.cse20 (store (store .cse6 .cse7 v_DerPreprocessor_11) .cse23 v_prenex_18))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_prenex_17)) (.cse21 (select .cse20 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse19 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse20) .cse21) .cse22)) (select (select .cse19 .cse21) .cse22)))) 9)) (not (= v_prenex_17 (store (store .cse8 .cse7 (select v_prenex_17 .cse7)) .cse23 (select v_prenex_17 .cse23)))) (< .cse22 0)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_94| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-22 16:30:25,984 INFO L349 Elim1Store]: treesize reduction 48, result has 78.7 percent of original size [2023-11-22 16:30:25,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 1093287 treesize of output 1016482 [2023-11-22 16:30:36,562 WARN L293 SmtUtils]: Spent 10.57s on a formula simplification. DAG size of input: 893 DAG size of output: 573 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 16:30:38,065 INFO L349 Elim1Store]: treesize reduction 596, result has 58.4 percent of original size [2023-11-22 16:30:38,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 72008 treesize of output 56984 [2023-11-22 16:31:13,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 11 treesize of output 5 [2023-11-22 16:32:37,653 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 221 treesize of output 205 [2023-11-22 16:32:44,267 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 221 treesize of output 205 [2023-11-22 16:32:50,386 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 221 treesize of output 205 [2023-11-22 16:32:56,977 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 112 treesize of output 104 [2023-11-22 16:32:57,169 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 112 treesize of output 104 [2023-11-22 16:32:57,501 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 112 treesize of output 104 [2023-11-22 16:33:00,398 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 182 treesize of output 166 [2023-11-22 16:33:00,502 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 138 treesize of output 126 [2023-11-22 16:33:00,576 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 158 treesize of output 144 [2023-11-22 16:33:00,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 138 treesize of output 126 [2023-11-22 16:33:00,732 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 118 treesize of output 108 [2023-11-22 16:33:00,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 148 [2023-11-22 16:33:00,936 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 105 treesize of output 95 [2023-11-22 16:33:00,996 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 125 treesize of output 113 [2023-11-22 16:33:01,064 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 145 treesize of output 131 [2023-11-22 16:33:01,151 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 105 treesize of output 95 [2023-11-22 16:33:01,224 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 101 treesize of output 91 [2023-11-22 16:33:01,296 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 81 treesize of output 73 [2023-11-22 16:33:01,361 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 61 treesize of output 55 [2023-11-22 16:33:01,405 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 81 treesize of output 73 [2023-11-22 16:33:01,474 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 85 treesize of output 77 [2023-11-22 16:33:01,530 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 105 treesize of output 95 [2023-11-22 16:33:01,609 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 125 treesize of output 113 [2023-11-22 16:33:01,700 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 125 treesize of output 113 [2023-11-22 16:33:01,786 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 101 treesize of output 91 [2023-11-22 16:33:01,861 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 81 treesize of output 73 [2023-11-22 16:33:01,927 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 101 treesize of output 91 [2023-11-22 16:33:01,991 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 121 treesize of output 109 [2023-11-22 16:33:02,095 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 162 treesize of output 148 [2023-11-22 16:33:02,184 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 142 treesize of output 130 [2023-11-22 16:33:02,273 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 142 treesize of output 130 [2023-11-22 16:33:02,357 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 122 treesize of output 112 [2023-11-22 16:33:02,429 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 162 treesize of output 148 [2023-11-22 16:33:02,524 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 118 treesize of output 108 [2023-11-22 16:33:02,591 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 138 treesize of output 126 [2023-11-22 16:33:02,673 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 118 treesize of output 108 [2023-11-22 16:33:02,745 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 98 treesize of output 90 [2023-11-22 16:33:02,820 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 142 treesize of output 130 [2023-11-22 16:33:03,245 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 182 treesize of output 166 [2023-11-22 16:33:03,336 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 138 treesize of output 126 [2023-11-22 16:33:03,400 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 158 treesize of output 144 [2023-11-22 16:33:03,475 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 138 treesize of output 126 [2023-11-22 16:33:03,548 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 118 treesize of output 108 [2023-11-22 16:33:03,626 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 162 treesize of output 148 [2023-11-22 16:33:03,740 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 105 treesize of output 95 [2023-11-22 16:33:03,799 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 125 treesize of output 113 [2023-11-22 16:33:03,869 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 145 treesize of output 131 [2023-11-22 16:33:03,958 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 105 treesize of output 95 [2023-11-22 16:33:04,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2023-11-22 16:33:04,094 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 81 treesize of output 73 [2023-11-22 16:33:04,153 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 61 treesize of output 55 [2023-11-22 16:33:04,198 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 81 treesize of output 73 [2023-11-22 16:33:04,267 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 85 treesize of output 77 [2023-11-22 16:33:04,326 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 105 treesize of output 95 [2023-11-22 16:33:04,396 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 125 treesize of output 113 [2023-11-22 16:33:04,576 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 125 treesize of output 113 [2023-11-22 16:33:04,647 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 101 treesize of output 91 [2023-11-22 16:33:04,706 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 81 treesize of output 73 [2023-11-22 16:33:04,758 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 101 treesize of output 91 [2023-11-22 16:33:04,813 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 121 treesize of output 109 [2023-11-22 16:33:04,905 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 162 treesize of output 148 [2023-11-22 16:33:04,996 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 142 treesize of output 130 [2023-11-22 16:33:05,081 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 142 treesize of output 130 [2023-11-22 16:33:05,150 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 122 treesize of output 112 [2023-11-22 16:33:05,212 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 162 treesize of output 148 [2023-11-22 16:33:05,292 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 118 treesize of output 108 [2023-11-22 16:33:05,345 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 138 treesize of output 126 [2023-11-22 16:33:05,415 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 118 treesize of output 108 [2023-11-22 16:33:05,475 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 98 treesize of output 90 [2023-11-22 16:33:05,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 142 treesize of output 130 [2023-11-22 16:33:05,692 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 182 treesize of output 166 [2023-11-22 16:33:05,780 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 138 treesize of output 126 [2023-11-22 16:33:05,836 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 158 treesize of output 144 [2023-11-22 16:33:05,902 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 138 treesize of output 126 [2023-11-22 16:33:05,965 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 118 treesize of output 108 [2023-11-22 16:33:06,031 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 162 treesize of output 148 [2023-11-22 16:33:06,130 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 105 treesize of output 95 [2023-11-22 16:33:06,179 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 125 treesize of output 113 [2023-11-22 16:33:06,236 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 145 treesize of output 131 [2023-11-22 16:33:06,308 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 105 treesize of output 95 [2023-11-22 16:33:06,365 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 101 treesize of output 91 [2023-11-22 16:33:06,423 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 81 treesize of output 73 [2023-11-22 16:33:06,470 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 61 treesize of output 55 [2023-11-22 16:33:06,507 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 81 treesize of output 73 [2023-11-22 16:33:06,565 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 85 treesize of output 77 [2023-11-22 16:33:06,617 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 105 treesize of output 95 [2023-11-22 16:33:06,674 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 125 treesize of output 113 [2023-11-22 16:33:06,748 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 125 treesize of output 113 [2023-11-22 16:33:06,817 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 101 treesize of output 91 [2023-11-22 16:33:06,875 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 81 treesize of output 73 [2023-11-22 16:33:06,930 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 101 treesize of output 91 [2023-11-22 16:33:06,982 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 121 treesize of output 109 [2023-11-22 16:33:07,069 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 162 treesize of output 148 [2023-11-22 16:33:07,143 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 142 treesize of output 130 [2023-11-22 16:33:07,219 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 142 treesize of output 130 [2023-11-22 16:33:07,284 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 122 treesize of output 112 [2023-11-22 16:33:07,345 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 162 treesize of output 148 [2023-11-22 16:33:07,428 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 118 treesize of output 108 [2023-11-22 16:33:07,482 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 138 treesize of output 126 [2023-11-22 16:33:07,551 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 118 treesize of output 108 [2023-11-22 16:33:07,614 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 98 treesize of output 90 [2023-11-22 16:33:07,679 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 142 treesize of output 130 [2023-11-22 16:33:09,993 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 162 treesize of output 148 [2023-11-22 16:33:10,281 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 162 treesize of output 148 [2023-11-22 16:33:10,547 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 162 treesize of output 148 [2023-11-22 16:33:10,698 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 125 treesize of output 113 [2023-11-22 16:33:11,053 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 125 treesize of output 113 [2023-11-22 16:33:11,255 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 125 treesize of output 113 [2023-11-22 16:33:11,436 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 186 treesize of output 170 [2023-11-22 16:33:11,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 170 [2023-11-22 16:33:11,782 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 186 treesize of output 170 [2023-11-22 16:33:12,112 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 149 treesize of output 135 [2023-11-22 16:33:12,402 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 149 treesize of output 135 [2023-11-22 16:33:12,608 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 149 treesize of output 135 [2023-11-22 16:33:12,873 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 105 treesize of output 95 [2023-11-22 16:33:12,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 130 [2023-11-22 16:33:13,008 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 166 treesize of output 152 [2023-11-22 16:33:13,099 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 129 treesize of output 117 [2023-11-22 16:33:13,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 105 treesize of output 95 [2023-11-22 16:33:13,655 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 142 treesize of output 130 [2023-11-22 16:33:13,721 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 166 treesize of output 152 [2023-11-22 16:33:13,801 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 129 treesize of output 117 [2023-11-22 16:33:14,030 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 105 treesize of output 95 [2023-11-22 16:33:14,084 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 142 treesize of output 130 [2023-11-22 16:33:14,161 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 166 treesize of output 152 [2023-11-22 16:33:14,247 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 129 treesize of output 117 [2023-11-22 16:33:15,153 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 162 treesize of output 148 [2023-11-22 16:33:15,222 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 186 treesize of output 170 [2023-11-22 16:33:15,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 149 treesize of output 135 [2023-11-22 16:33:15,376 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 125 treesize of output 113 [2023-11-22 16:33:15,612 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 162 treesize of output 148 [2023-11-22 16:33:15,679 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 186 treesize of output 170 [2023-11-22 16:33:15,755 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 149 treesize of output 135 [2023-11-22 16:33:15,828 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 125 treesize of output 113 [2023-11-22 16:33:15,952 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 162 treesize of output 148 [2023-11-22 16:33:16,034 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 186 treesize of output 170 [2023-11-22 16:33:16,128 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 149 treesize of output 135 [2023-11-22 16:33:16,216 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 125 treesize of output 113 [2023-11-22 16:33:16,619 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 182 treesize of output 166 [2023-11-22 16:33:16,753 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 182 treesize of output 166 [2023-11-22 16:33:17,015 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 182 treesize of output 166 [2023-11-22 16:33:17,496 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 169 treesize of output 153 [2023-11-22 16:33:17,595 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 169 treesize of output 153 [2023-11-22 16:33:17,931 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 169 treesize of output 153 [2023-11-22 16:33:18,042 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 145 treesize of output 131 [2023-11-22 16:33:18,132 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 145 treesize of output 131 [2023-11-22 16:33:18,325 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 145 treesize of output 131 [2023-11-22 16:33:20,092 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 129 treesize of output 117 [2023-11-22 16:33:20,261 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 109 treesize of output 99 [2023-11-22 16:33:20,334 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 166 treesize of output 152 [2023-11-22 16:33:20,415 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 122 treesize of output 112 [2023-11-22 16:33:20,485 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 142 treesize of output 130 [2023-11-22 16:33:20,556 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 105 treesize of output 95 [2023-11-22 16:33:20,622 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 85 treesize of output 77 [2023-11-22 16:33:20,710 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 146 treesize of output 134 [2023-11-22 16:33:20,785 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 186 treesize of output 170 [2023-11-22 16:33:20,882 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 166 treesize of output 152 [2023-11-22 16:33:20,987 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 125 treesize of output 113 [2023-11-22 16:33:21,063 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 105 treesize of output 95 [2023-11-22 16:33:21,125 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 162 treesize of output 148 [2023-11-22 16:33:21,212 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 142 treesize of output 130 [2023-11-22 16:33:21,303 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 129 treesize of output 117 [2023-11-22 16:33:21,375 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 149 treesize of output 135 [2023-11-22 16:33:21,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2023-11-22 16:33:21,781 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 109 treesize of output 99 [2023-11-22 16:33:21,842 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 166 treesize of output 152 [2023-11-22 16:33:21,911 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 122 treesize of output 112 [2023-11-22 16:33:21,972 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 142 treesize of output 130 [2023-11-22 16:33:22,038 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 105 treesize of output 95 [2023-11-22 16:33:22,093 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 85 treesize of output 77 [2023-11-22 16:33:22,173 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 146 treesize of output 134 [2023-11-22 16:33:22,242 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 186 treesize of output 170 [2023-11-22 16:33:22,319 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 166 treesize of output 152 [2023-11-22 16:33:22,419 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 125 treesize of output 113 [2023-11-22 16:33:22,489 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 105 treesize of output 95 [2023-11-22 16:33:22,541 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 162 treesize of output 148 [2023-11-22 16:33:22,618 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 142 treesize of output 130 [2023-11-22 16:33:22,699 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 129 treesize of output 117 [2023-11-22 16:33:22,762 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 149 treesize of output 135 [2023-11-22 16:33:22,921 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 129 treesize of output 117 [2023-11-22 16:33:22,989 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 109 treesize of output 99 [2023-11-22 16:33:23,055 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 166 treesize of output 152 [2023-11-22 16:33:23,133 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 122 treesize of output 112 [2023-11-22 16:33:23,198 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 142 treesize of output 130 [2023-11-22 16:33:23,267 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 105 treesize of output 95 [2023-11-22 16:33:23,325 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 85 treesize of output 77 [2023-11-22 16:33:23,409 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 146 treesize of output 134 [2023-11-22 16:33:23,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 186 treesize of output 170 [2023-11-22 16:33:23,566 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 166 treesize of output 152 [2023-11-22 16:33:23,666 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 125 treesize of output 113 [2023-11-22 16:33:23,742 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 105 treesize of output 95 [2023-11-22 16:33:23,803 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 162 treesize of output 148 [2023-11-22 16:33:23,885 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 142 treesize of output 130 [2023-11-22 16:33:23,972 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 129 treesize of output 117 [2023-11-22 16:33:24,043 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 149 treesize of output 135 [2023-11-22 16:33:33,207 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 136 treesize of output 126 [2023-11-22 16:33:34,449 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 136 treesize of output 126 [2023-11-22 16:33:41,900 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-22 16:33:41,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-22 16:33:41,904 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 16:33:41,916 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-22 16:33:42,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 16:33:42,107 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2023-11-22 16:33:42,115 INFO L158 Benchmark]: Toolchain (without parser) took 248066.21ms. Allocated memory was 163.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 127.7MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-22 16:33:42,115 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 86.7MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 16:33:42,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.74ms. Allocated memory is still 163.6MB. Free memory was 127.7MB in the beginning and 110.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 16:33:42,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.74ms. Allocated memory is still 163.6MB. Free memory was 110.2MB in the beginning and 108.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 16:33:42,116 INFO L158 Benchmark]: Boogie Preprocessor took 31.36ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 16:33:42,116 INFO L158 Benchmark]: RCFGBuilder took 505.19ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 121.0MB in the end (delta: -15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 16:33:42,116 INFO L158 Benchmark]: TraceAbstraction took 247133.89ms. Allocated memory was 163.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 120.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-22 16:33:42,117 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 86.7MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.74ms. Allocated memory is still 163.6MB. Free memory was 127.7MB in the beginning and 110.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.74ms. Allocated memory is still 163.6MB. Free memory was 110.2MB in the beginning and 108.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.36ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 505.19ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 121.0MB in the end (delta: -15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 247133.89ms. Allocated memory was 163.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 120.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 16:33:43,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 16:33:43,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-22 16:33:43,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 16:33:43,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 16:33:44,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 16:33:44,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 16:33:44,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 16:33:44,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 16:33:44,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 16:33:44,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 16:33:44,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 16:33:44,007 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 16:33:44,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 16:33:44,008 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 16:33:44,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 16:33:44,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 16:33:44,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 16:33:44,009 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 16:33:44,009 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 16:33:44,010 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 16:33:44,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 16:33:44,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 16:33:44,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 16:33:44,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 16:33:44,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 16:33:44,011 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 16:33:44,012 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 16:33:44,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 16:33:44,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 16:33:44,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 16:33:44,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 16:33:44,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:33:44,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 16:33:44,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 16:33:44,014 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 16:33:44,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 16:33:44,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 16:33:44,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 16:33:44,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 16:33:44,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 16:33:44,016 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 16:33:44,016 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2023-11-22 16:33:44,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 16:33:44,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 16:33:44,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 16:33:44,323 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 16:33:44,323 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 16:33:44,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2023-11-22 16:33:45,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 16:33:45,664 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 16:33:45,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2023-11-22 16:33:45,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec2f7cb6/a35f49af15a742c88ff8788875fc90be/FLAG6bcf0fd8b [2023-11-22 16:33:45,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec2f7cb6/a35f49af15a742c88ff8788875fc90be [2023-11-22 16:33:45,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 16:33:45,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 16:33:45,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 16:33:45,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 16:33:45,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 16:33:45,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:33:45" (1/1) ... [2023-11-22 16:33:45,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c06dda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:45, skipping insertion in model container [2023-11-22 16:33:45,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:33:45" (1/1) ... [2023-11-22 16:33:45,777 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 16:33:46,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:33:46,057 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 16:33:46,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:33:46,116 INFO L206 MainTranslator]: Completed translation [2023-11-22 16:33:46,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46 WrapperNode [2023-11-22 16:33:46,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 16:33:46,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 16:33:46,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 16:33:46,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 16:33:46,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,174 INFO L138 Inliner]: procedures = 122, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2023-11-22 16:33:46,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 16:33:46,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 16:33:46,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 16:33:46,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 16:33:46,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 16:33:46,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 16:33:46,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 16:33:46,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 16:33:46,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (1/1) ... [2023-11-22 16:33:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:33:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:33:46,245 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-22 16:33:46,250 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-22 16:33:46,281 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-22 16:33:46,281 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 16:33:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 16:33:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 16:33:46,382 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 16:33:46,384 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 16:33:46,835 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 16:33:46,866 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 16:33:46,866 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-22 16:33:46,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:33:46 BoogieIcfgContainer [2023-11-22 16:33:46,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 16:33:46,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 16:33:46,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 16:33:46,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 16:33:46,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:33:45" (1/3) ... [2023-11-22 16:33:46,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285dcaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:33:46, skipping insertion in model container [2023-11-22 16:33:46,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:33:46" (2/3) ... [2023-11-22 16:33:46,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285dcaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:33:46, skipping insertion in model container [2023-11-22 16:33:46,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:33:46" (3/3) ... [2023-11-22 16:33:46,872 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2023-11-22 16:33:46,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 16:33:46,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-11-22 16:33:46,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 16:33:46,921 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;@63f62780, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 16:33:46,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-22 16:33:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 99 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 16:33:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 16:33:46,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:46,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 16:33:46,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:46,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash 8135, now seen corresponding path program 1 times [2023-11-22 16:33:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134635406] [2023-11-22 16:33:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:46,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:46,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:46,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 16:33:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:47,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 16:33:47,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:47,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-22 16:33:47,081 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-22 16:33:47,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:47,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:47,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134635406] [2023-11-22 16:33:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134635406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:47,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:47,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 16:33:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181296171] [2023-11-22 16:33:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:47,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:33:47,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:47,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:33:47,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:33:47,122 INFO L87 Difference]: Start difference. First operand has 104 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 99 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-22 16:33:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:47,273 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-11-22 16:33:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:33:47,275 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-22 16:33:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:47,280 INFO L225 Difference]: With dead ends: 104 [2023-11-22 16:33:47,281 INFO L226 Difference]: Without dead ends: 103 [2023-11-22 16:33:47,282 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-22 16:33:47,284 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 82 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:47,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 67 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:33:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-22 16:33:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2023-11-22 16:33:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 91 states have internal predecessors, (98), 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-22 16:33:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-11-22 16:33:47,310 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 2 [2023-11-22 16:33:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:47,310 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-11-22 16:33:47,310 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-22 16:33:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-11-22 16:33:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 16:33:47,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:47,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 16:33:47,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:47,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:47,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:47,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:47,519 INFO L85 PathProgramCache]: Analyzing trace with hash 8136, now seen corresponding path program 1 times [2023-11-22 16:33:47,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:47,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948272594] [2023-11-22 16:33:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:47,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:47,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:47,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 16:33:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:47,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 16:33:47,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:47,560 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-22 16:33:47,567 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-22 16:33:47,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:47,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948272594] [2023-11-22 16:33:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948272594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:47,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:47,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 16:33:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331768753] [2023-11-22 16:33:47,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:47,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:33:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:47,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:33:47,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:33:47,571 INFO L87 Difference]: Start difference. First operand 93 states and 101 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-22 16:33:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:47,691 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-22 16:33:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:33:47,693 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-22 16:33:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:47,694 INFO L225 Difference]: With dead ends: 100 [2023-11-22 16:33:47,694 INFO L226 Difference]: Without dead ends: 100 [2023-11-22 16:33:47,694 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-22 16:33:47,695 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 79 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:47,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 70 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:33:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-22 16:33:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2023-11-22 16:33:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 2.066666666666667) internal successors, (93), 86 states have internal predecessors, (93), 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-22 16:33:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-11-22 16:33:47,706 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 2 [2023-11-22 16:33:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:47,706 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-11-22 16:33:47,707 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-22 16:33:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-11-22 16:33:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 16:33:47,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:47,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:47,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:47,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:47,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:47,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 962070555, now seen corresponding path program 1 times [2023-11-22 16:33:47,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941616407] [2023-11-22 16:33:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:47,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:47,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 16:33:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:48,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 16:33:48,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:48,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-22 16:33:48,055 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-22 16:33:48,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:48,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:48,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941616407] [2023-11-22 16:33:48,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941616407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:48,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:48,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:33:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699741597] [2023-11-22 16:33:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:48,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 16:33:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 16:33:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:33:48,064 INFO L87 Difference]: Start difference. First operand 88 states and 96 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-22 16:33:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:48,308 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-22 16:33:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:33:48,309 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-22 16:33:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:48,309 INFO L225 Difference]: With dead ends: 85 [2023-11-22 16:33:48,309 INFO L226 Difference]: Without dead ends: 85 [2023-11-22 16:33:48,310 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-22 16:33:48,310 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:48,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 47 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:33:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-22 16:33:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2023-11-22 16:33:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.8) internal successors, (81), 74 states have internal predecessors, (81), 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-22 16:33:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2023-11-22 16:33:48,314 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 7 [2023-11-22 16:33:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:48,314 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2023-11-22 16:33:48,315 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-22 16:33:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2023-11-22 16:33:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 16:33:48,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:48,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:48,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:48,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:48,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:48,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash 962070556, now seen corresponding path program 1 times [2023-11-22 16:33:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:48,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823682117] [2023-11-22 16:33:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:48,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:48,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:48,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:48,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-22 16:33:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:48,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 16:33:48,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:48,593 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-22 16:33:48,648 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-22 16:33:48,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:48,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823682117] [2023-11-22 16:33:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823682117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:48,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:33:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331915346] [2023-11-22 16:33:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 16:33:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 16:33:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:33:48,650 INFO L87 Difference]: Start difference. First operand 76 states and 84 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-22 16:33:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:48,896 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2023-11-22 16:33:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 16:33:48,898 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-22 16:33:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:48,898 INFO L225 Difference]: With dead ends: 97 [2023-11-22 16:33:48,898 INFO L226 Difference]: Without dead ends: 97 [2023-11-22 16:33:48,898 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-22 16:33:48,899 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 83 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:48,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 85 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:33:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-22 16:33:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2023-11-22 16:33:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.75) internal successors, (91), 81 states have internal predecessors, (91), 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-22 16:33:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2023-11-22 16:33:48,903 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 7 [2023-11-22 16:33:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:48,904 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2023-11-22 16:33:48,904 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-22 16:33:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2023-11-22 16:33:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:33:48,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:48,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:48,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:49,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:49,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:49,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1132029993, now seen corresponding path program 1 times [2023-11-22 16:33:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732282050] [2023-11-22 16:33:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:49,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:49,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:49,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:49,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 16:33:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:49,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 16:33:49,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:49,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-22 16:33:49,205 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-22 16:33:49,228 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 11 [2023-11-22 16:33:49,237 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-22 16:33:49,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:49,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732282050] [2023-11-22 16:33:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732282050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:49,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:33:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508139981] [2023-11-22 16:33:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:49,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 16:33:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 16:33:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:33:49,240 INFO L87 Difference]: Start difference. First operand 83 states and 94 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-22 16:33:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:49,470 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2023-11-22 16:33:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:33:49,471 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-22 16:33:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:49,471 INFO L225 Difference]: With dead ends: 82 [2023-11-22 16:33:49,471 INFO L226 Difference]: Without dead ends: 82 [2023-11-22 16:33:49,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-22 16:33:49,472 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:49,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:33:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-22 16:33:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-22 16:33:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 80 states have internal predecessors, (89), 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-22 16:33:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2023-11-22 16:33:49,476 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 9 [2023-11-22 16:33:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:49,477 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2023-11-22 16:33:49,477 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-22 16:33:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2023-11-22 16:33:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:33:49,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:49,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:49,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:49,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:49,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:49,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:49,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1132029994, now seen corresponding path program 1 times [2023-11-22 16:33:49,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:49,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765306718] [2023-11-22 16:33:49,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:49,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:49,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:49,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:49,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-22 16:33:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:49,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 16:33:49,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:49,767 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-22 16:33:49,787 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-22 16:33:49,793 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-22 16:33:49,823 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 17 treesize of output 9 [2023-11-22 16:33:49,834 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-22 16:33:49,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:49,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:49,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765306718] [2023-11-22 16:33:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765306718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:49,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:49,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:33:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944905825] [2023-11-22 16:33:49,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:49,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 16:33:49,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:49,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 16:33:49,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:33:49,836 INFO L87 Difference]: Start difference. First operand 82 states and 92 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-22 16:33:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:50,064 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-22 16:33:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:33:50,066 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-22 16:33:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:50,066 INFO L225 Difference]: With dead ends: 81 [2023-11-22 16:33:50,066 INFO L226 Difference]: Without dead ends: 81 [2023-11-22 16:33:50,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-22 16:33:50,067 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:50,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 186 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:33:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-22 16:33:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-22 16:33:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 79 states have internal predecessors, (87), 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-22 16:33:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-11-22 16:33:50,070 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 9 [2023-11-22 16:33:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:50,070 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-11-22 16:33:50,070 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-22 16:33:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-11-22 16:33:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 16:33:50,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:50,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:50,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:50,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:50,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:50,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1114082243, now seen corresponding path program 1 times [2023-11-22 16:33:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:50,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206331989] [2023-11-22 16:33:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:50,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:50,276 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:50,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-22 16:33:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:50,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-22 16:33:50,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:50,364 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 11 treesize of output 7 [2023-11-22 16:33:50,386 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-22 16:33:50,407 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-22 16:33:50,487 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-22 16:33:50,503 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 15 treesize of output 7 [2023-11-22 16:33:50,510 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-22 16:33:50,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:50,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206331989] [2023-11-22 16:33:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206331989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:33:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335401196] [2023-11-22 16:33:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:50,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:33:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:33:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:33:50,513 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-22 16:33:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:50,734 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2023-11-22 16:33:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:33:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2023-11-22 16:33:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:50,736 INFO L225 Difference]: With dead ends: 154 [2023-11-22 16:33:50,736 INFO L226 Difference]: Without dead ends: 154 [2023-11-22 16:33:50,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:33:50,736 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 238 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:50,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 167 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:33:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-22 16:33:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 83. [2023-11-22 16:33:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 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-22 16:33:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2023-11-22 16:33:50,740 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 12 [2023-11-22 16:33:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:50,741 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2023-11-22 16:33:50,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-22 16:33:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2023-11-22 16:33:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:33:50,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:50,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:50,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:50,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:50,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:50,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1072441226, now seen corresponding path program 1 times [2023-11-22 16:33:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:50,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232851754] [2023-11-22 16:33:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:50,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:50,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:50,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:50,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-22 16:33:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:51,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 16:33:51,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:51,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-22 16:33:51,027 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-22 16:33:51,043 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 23 treesize of output 11 [2023-11-22 16:33:51,060 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 23 treesize of output 11 [2023-11-22 16:33:51,134 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 23 treesize of output 11 [2023-11-22 16:33:51,144 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 15 treesize of output 7 [2023-11-22 16:33:51,152 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-22 16:33:51,152 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:51,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232851754] [2023-11-22 16:33:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232851754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:51,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:33:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987502600] [2023-11-22 16:33:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:51,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:33:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:33:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:33:51,155 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-22 16:33:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:51,408 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2023-11-22 16:33:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:33:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-22 16:33:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:51,410 INFO L225 Difference]: With dead ends: 126 [2023-11-22 16:33:51,410 INFO L226 Difference]: Without dead ends: 126 [2023-11-22 16:33:51,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:33:51,410 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 179 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:51,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 93 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:33:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-22 16:33:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2023-11-22 16:33:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 96 states have internal predecessors, (119), 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-22 16:33:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2023-11-22 16:33:51,413 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 11 [2023-11-22 16:33:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:51,414 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2023-11-22 16:33:51,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-22 16:33:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2023-11-22 16:33:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:33:51,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:51,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:51,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:51,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:51,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:51,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1072441227, now seen corresponding path program 1 times [2023-11-22 16:33:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522167309] [2023-11-22 16:33:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:51,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:51,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:51,616 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:51,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-22 16:33:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:51,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-22 16:33:51,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:51,701 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-22 16:33:51,715 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-22 16:33:51,719 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-22 16:33:51,748 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 23 treesize of output 11 [2023-11-22 16:33:51,757 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 23 treesize of output 11 [2023-11-22 16:33:51,775 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 23 treesize of output 11 [2023-11-22 16:33:51,799 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 23 treesize of output 11 [2023-11-22 16:33:51,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 23 treesize of output 11 [2023-11-22 16:33:51,864 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 23 treesize of output 11 [2023-11-22 16:33:51,874 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 15 treesize of output 7 [2023-11-22 16:33:51,877 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 7 treesize of output 3 [2023-11-22 16:33:51,891 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-22 16:33:51,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:51,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522167309] [2023-11-22 16:33:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522167309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:51,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:51,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:33:51,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317828996] [2023-11-22 16:33:51,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:51,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:33:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:51,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:33:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:33:51,893 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-22 16:33:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:52,180 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2023-11-22 16:33:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 16:33:52,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-22 16:33:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:52,181 INFO L225 Difference]: With dead ends: 129 [2023-11-22 16:33:52,181 INFO L226 Difference]: Without dead ends: 129 [2023-11-22 16:33:52,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:33:52,181 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 207 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:52,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 104 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 16:33:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-22 16:33:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2023-11-22 16:33:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.605263157894737) internal successors, (122), 103 states have internal predecessors, (122), 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-22 16:33:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2023-11-22 16:33:52,185 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 11 [2023-11-22 16:33:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:52,185 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2023-11-22 16:33:52,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-22 16:33:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2023-11-22 16:33:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:33:52,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:52,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:52,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-22 16:33:52,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:52,386 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:52,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1254278380, now seen corresponding path program 1 times [2023-11-22 16:33:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939362904] [2023-11-22 16:33:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:52,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:52,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:52,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-22 16:33:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:52,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-22 16:33:52,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:52,499 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-22 16:33:52,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 22 [2023-11-22 16:33:52,568 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-22 16:33:52,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-22 16:33:52,608 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-22 16:33:52,698 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:33:52,699 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 52 treesize of output 49 [2023-11-22 16:33:52,717 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 43 treesize of output 27 [2023-11-22 16:33:52,764 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-22 16:33:52,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:52,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:52,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939362904] [2023-11-22 16:33:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939362904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:52,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:33:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389949051] [2023-11-22 16:33:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:52,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:33:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:33:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:33:52,766 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-22 16:33:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:33:53,262 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2023-11-22 16:33:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 16:33:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-22 16:33:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:33:53,263 INFO L225 Difference]: With dead ends: 138 [2023-11-22 16:33:53,263 INFO L226 Difference]: Without dead ends: 138 [2023-11-22 16:33:53,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-22 16:33:53,264 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 124 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 16:33:53,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 133 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 16:33:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-22 16:33:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 106. [2023-11-22 16:33:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 104 states have internal predecessors, (124), 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-22 16:33:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2023-11-22 16:33:53,266 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 11 [2023-11-22 16:33:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:33:53,266 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2023-11-22 16:33:53,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-22 16:33:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2023-11-22 16:33:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:33:53,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:33:53,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:33:53,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-22 16:33:53,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:53,470 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-22 16:33:53,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:33:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1254278381, now seen corresponding path program 1 times [2023-11-22 16:33:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:33:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372688807] [2023-11-22 16:33:53,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:33:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:33:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:33:53,472 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:33:53,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-22 16:33:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:33:53,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-22 16:33:53,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:33:53,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-22 16:33:53,585 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 16:33:53,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 16:33:53,592 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 6 treesize of output 5 [2023-11-22 16:33:53,621 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-22 16:33:53,624 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-22 16:33:53,679 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:33:53,680 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-22 16:33:53,687 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-22 16:33:53,699 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-22 16:33:53,707 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-22 16:33:53,718 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-22 16:33:53,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:33:53,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:33:53,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372688807] [2023-11-22 16:33:53,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372688807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:33:53,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:33:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:33:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721959051] [2023-11-22 16:33:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:33:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:33:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:33:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:33:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:33:53,720 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) Killed by 15