./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:29:27,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:29:27,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:29:27,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:29:27,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:29:27,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:29:27,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:29:27,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:29:27,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:29:27,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:29:27,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:29:27,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:29:27,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:29:27,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:29:27,710 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:29:27,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:29:27,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:29:27,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:29:27,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:29:27,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:29:27,714 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:29:27,715 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:29:27,716 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:29:27,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:29:27,716 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:29:27,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:29:27,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:29:27,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:29:27,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:29:27,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:29:27,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:29:27,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:29:27,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:29:27,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:29:27,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:29:27,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:29:27,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:29:27,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:29:27,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:29:27,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:29:27,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:29:27,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:29:27,721 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2024-10-24 16:29:28,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:29:28,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:29:28,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:29:28,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:29:28,052 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:29:28,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-10-24 16:29:29,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:29:29,708 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:29:29,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-10-24 16:29:29,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6fa9145e/30f5d030463642838d122d12db385732/FLAG3e2fedd1d [2024-10-24 16:29:29,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6fa9145e/30f5d030463642838d122d12db385732 [2024-10-24 16:29:29,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:29:29,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:29:29,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:29,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:29:29,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:29:29,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:29" (1/1) ... [2024-10-24 16:29:29,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7d878b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:29, skipping insertion in model container [2024-10-24 16:29:29,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:29" (1/1) ... [2024-10-24 16:29:29,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:29:30,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:30,117 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:29:30,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:30,195 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:29:30,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30 WrapperNode [2024-10-24 16:29:30,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:30,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:29:30,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:29:30,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:29:30,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,247 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-10-24 16:29:30,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:29:30,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:29:30,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:29:30,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:29:30,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,298 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-10-24 16:29:30,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:29:30,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:29:30,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:29:30,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:29:30,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (1/1) ... [2024-10-24 16:29:30,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:29:30,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:30,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:29:30,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:29:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-10-24 16:29:30,416 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-10-24 16:29:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 16:29:30,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 16:29:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:29:30,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:29:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:29:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:29:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:29:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:29:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:29:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:29:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:29:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:29:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:29:30,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:29:30,589 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:29:30,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:29:30,953 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-24 16:29:30,953 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:29:30,984 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:29:30,985 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 16:29:30,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:30 BoogieIcfgContainer [2024-10-24 16:29:30,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:29:30,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:29:30,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:29:30,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:29:30,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:29:29" (1/3) ... [2024-10-24 16:29:30,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3637d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:30, skipping insertion in model container [2024-10-24 16:29:30,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:30" (2/3) ... [2024-10-24 16:29:30,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3637d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:30, skipping insertion in model container [2024-10-24 16:29:30,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:30" (3/3) ... [2024-10-24 16:29:30,995 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-10-24 16:29:31,011 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:29:31,013 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-24 16:29:31,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:29:31,073 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@66827ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:29:31,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-24 16:29:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 96 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:29:31,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:31,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:29:31,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:31,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 6904, now seen corresponding path program 1 times [2024-10-24 16:29:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432526698] [2024-10-24 16:29:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432526698] [2024-10-24 16:29:31,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432526698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:31,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:31,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:29:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231021337] [2024-10-24 16:29:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:31,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:31,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:31,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:31,332 INFO L87 Difference]: Start difference. First operand has 105 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 96 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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) [2024-10-24 16:29:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:31,468 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-10-24 16:29:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:31,471 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 [2024-10-24 16:29:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:31,479 INFO L225 Difference]: With dead ends: 102 [2024-10-24 16:29:31,479 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 16:29:31,481 INFO L431 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 [2024-10-24 16:29:31,484 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 77 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:31,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 16:29:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 16:29:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 51 states have (on average 2.0) internal successors, (102), 92 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-10-24 16:29:31,525 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 2 [2024-10-24 16:29:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:31,526 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-10-24 16:29:31,526 INFO L472 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) [2024-10-24 16:29:31,526 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-10-24 16:29:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:29:31,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:31,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:29:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:29:31,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:31,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 6905, now seen corresponding path program 1 times [2024-10-24 16:29:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91576111] [2024-10-24 16:29:31,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:31,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91576111] [2024-10-24 16:29:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91576111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:31,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:31,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:29:31,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090757444] [2024-10-24 16:29:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:31,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:31,631 INFO L87 Difference]: Start difference. First operand 101 states and 114 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) [2024-10-24 16:29:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:31,721 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-24 16:29:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:31,721 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 [2024-10-24 16:29:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:31,724 INFO L225 Difference]: With dead ends: 99 [2024-10-24 16:29:31,724 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 16:29:31,724 INFO L431 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 [2024-10-24 16:29:31,725 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:31,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 16:29:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 16:29:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 90 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-24 16:29:31,746 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 2 [2024-10-24 16:29:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:31,749 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-24 16:29:31,749 INFO L472 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) [2024-10-24 16:29:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-24 16:29:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:29:31,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:31,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:31,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:29:31,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:31,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:31,752 INFO L85 PathProgramCache]: Analyzing trace with hash 233145900, now seen corresponding path program 1 times [2024-10-24 16:29:31,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:31,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252453533] [2024-10-24 16:29:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:31,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252453533] [2024-10-24 16:29:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252453533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:31,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719409128] [2024-10-24 16:29:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:31,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:31,855 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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) [2024-10-24 16:29:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:31,946 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2024-10-24 16:29:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:31,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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 [2024-10-24 16:29:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:31,949 INFO L225 Difference]: With dead ends: 98 [2024-10-24 16:29:31,951 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 16:29:31,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:31,953 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:31,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 16:29:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 16:29:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 88 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-10-24 16:29:31,972 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 7 [2024-10-24 16:29:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:31,972 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-10-24 16:29:31,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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) [2024-10-24 16:29:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-10-24 16:29:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:29:31,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:31,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:31,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:29:31,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:31,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 233145901, now seen corresponding path program 1 times [2024-10-24 16:29:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263980858] [2024-10-24 16:29:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263980858] [2024-10-24 16:29:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263980858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:32,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772637278] [2024-10-24 16:29:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:32,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:32,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:32,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:32,112 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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) [2024-10-24 16:29:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:32,181 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2024-10-24 16:29:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:32,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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 [2024-10-24 16:29:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:32,183 INFO L225 Difference]: With dead ends: 96 [2024-10-24 16:29:32,183 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 16:29:32,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:32,185 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:32,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 160 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 16:29:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 16:29:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 86 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-24 16:29:32,193 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 7 [2024-10-24 16:29:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:32,193 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-24 16:29:32,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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) [2024-10-24 16:29:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-24 16:29:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:29:32,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:32,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:32,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:29:32,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:32,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash 717072888, now seen corresponding path program 1 times [2024-10-24 16:29:32,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967097990] [2024-10-24 16:29:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:32,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967097990] [2024-10-24 16:29:32,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967097990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:32,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:32,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592596999] [2024-10-24 16:29:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:32,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:32,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:32,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:32,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:32,374 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-24 16:29:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:32,461 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2024-10-24 16:29:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:32,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-24 16:29:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:32,464 INFO L225 Difference]: With dead ends: 169 [2024-10-24 16:29:32,464 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 16:29:32,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:32,467 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:32,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 374 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 16:29:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 137. [2024-10-24 16:29:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.9431818181818181) internal successors, (171), 124 states have internal predecessors, (171), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:29:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2024-10-24 16:29:32,491 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 9 [2024-10-24 16:29:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:32,492 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2024-10-24 16:29:32,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-24 16:29:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2024-10-24 16:29:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:29:32,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:32,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:32,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:29:32,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:32,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 714911023, now seen corresponding path program 1 times [2024-10-24 16:29:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998821461] [2024-10-24 16:29:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:32,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998821461] [2024-10-24 16:29:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998821461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:32,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:32,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:29:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866984675] [2024-10-24 16:29:32,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:32,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:32,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:32,674 INFO L87 Difference]: Start difference. First operand 137 states and 191 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) [2024-10-24 16:29:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:32,789 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-10-24 16:29:32,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:29:32,789 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 [2024-10-24 16:29:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:32,792 INFO L225 Difference]: With dead ends: 136 [2024-10-24 16:29:32,795 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 16:29:32,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:32,797 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 137 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:32,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 116 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 16:29:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-24 16:29:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 123 states have internal predecessors, (169), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:29:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-24 16:29:32,817 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 9 [2024-10-24 16:29:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:32,818 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-24 16:29:32,818 INFO L472 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) [2024-10-24 16:29:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-24 16:29:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:29:32,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:32,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:32,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:29:32,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:32,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash 714911024, now seen corresponding path program 1 times [2024-10-24 16:29:32,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:32,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994234741] [2024-10-24 16:29:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:32,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994234741] [2024-10-24 16:29:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994234741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:33,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:33,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570456542] [2024-10-24 16:29:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:33,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:29:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:29:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:29:33,010 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2024-10-24 16:29:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:33,110 INFO L93 Difference]: Finished difference Result 135 states and 187 transitions. [2024-10-24 16:29:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:33,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2024-10-24 16:29:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:33,112 INFO L225 Difference]: With dead ends: 135 [2024-10-24 16:29:33,112 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 16:29:33,112 INFO L431 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 [2024-10-24 16:29:33,113 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 137 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:33,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 101 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 16:29:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-24 16:29:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.8977272727272727) internal successors, (167), 122 states have internal predecessors, (167), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:29:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 187 transitions. [2024-10-24 16:29:33,128 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 187 transitions. Word has length 9 [2024-10-24 16:29:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:33,129 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 187 transitions. [2024-10-24 16:29:33,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2024-10-24 16:29:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 187 transitions. [2024-10-24 16:29:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:29:33,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:33,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:29:33,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash -177375370, now seen corresponding path program 1 times [2024-10-24 16:29:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714777938] [2024-10-24 16:29:33,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:33,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:29:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714777938] [2024-10-24 16:29:33,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714777938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:33,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:33,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373362802] [2024-10-24 16:29:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:33,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:33,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:33,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:33,207 INFO L87 Difference]: Start difference. First operand 135 states and 187 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:33,404 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2024-10-24 16:29:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:33,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-24 16:29:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:33,406 INFO L225 Difference]: With dead ends: 156 [2024-10-24 16:29:33,406 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 16:29:33,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:33,407 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 269 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:33,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 163 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 16:29:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2024-10-24 16:29:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 117 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:29:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-10-24 16:29:33,412 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 14 [2024-10-24 16:29:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:33,413 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-10-24 16:29:33,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-10-24 16:29:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:29:33,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:33,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:33,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:29:33,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:33,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:33,415 INFO L85 PathProgramCache]: Analyzing trace with hash -177375369, now seen corresponding path program 1 times [2024-10-24 16:29:33,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:33,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024677079] [2024-10-24 16:29:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:29:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:33,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:33,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024677079] [2024-10-24 16:29:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024677079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:33,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:33,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:33,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764587239] [2024-10-24 16:29:33,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:33,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:33,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:33,569 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:33,791 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2024-10-24 16:29:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:33,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-24 16:29:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:33,793 INFO L225 Difference]: With dead ends: 151 [2024-10-24 16:29:33,793 INFO L226 Difference]: Without dead ends: 151 [2024-10-24 16:29:33,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:33,794 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 191 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:33,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 218 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-24 16:29:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2024-10-24 16:29:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 117 states have internal predecessors, (150), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:29:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2024-10-24 16:29:33,801 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 14 [2024-10-24 16:29:33,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:33,801 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2024-10-24 16:29:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2024-10-24 16:29:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:29:33,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:33,804 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:33,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:29:33,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:33,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:33,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2103323471, now seen corresponding path program 1 times [2024-10-24 16:29:33,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:33,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667730880] [2024-10-24 16:29:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667730880] [2024-10-24 16:29:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667730880] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188044375] [2024-10-24 16:29:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:33,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:33,889 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) [2024-10-24 16:29:33,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:29:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:33,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:29:33,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:34,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:34,096 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:29:34,097 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 12 treesize of output 11 [2024-10-24 16:29:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188044375] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:34,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:29:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-24 16:29:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104010525] [2024-10-24 16:29:34,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:34,116 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2024-10-24 16:29:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:34,285 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2024-10-24 16:29:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:29:34,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 [2024-10-24 16:29:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:34,287 INFO L225 Difference]: With dead ends: 144 [2024-10-24 16:29:34,287 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 16:29:34,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:34,288 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 139 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:34,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 16:29:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2024-10-24 16:29:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 123 states have internal predecessors, (160), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:29:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2024-10-24 16:29:34,294 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 17 [2024-10-24 16:29:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:34,294 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2024-10-24 16:29:34,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2024-10-24 16:29:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2024-10-24 16:29:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:29:34,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:34,297 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:34,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:29:34,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 16:29:34,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:34,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2103323470, now seen corresponding path program 1 times [2024-10-24 16:29:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:34,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393082269] [2024-10-24 16:29:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393082269] [2024-10-24 16:29:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393082269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438007949] [2024-10-24 16:29:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:34,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:34,658 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) [2024-10-24 16:29:34,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 16:29:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:34,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 16:29:34,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:34,780 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 [2024-10-24 16:29:34,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:34,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-24 16:29:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:34,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:35,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438007949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:35,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:29:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2024-10-24 16:29:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660172042] [2024-10-24 16:29:35,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:35,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:29:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:35,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:29:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:29:35,218 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:35,543 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2024-10-24 16:29:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:29:35,543 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-24 16:29:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:35,545 INFO L225 Difference]: With dead ends: 142 [2024-10-24 16:29:35,545 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 16:29:35,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:29:35,546 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 315 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:35,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 231 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:29:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 16:29:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2024-10-24 16:29:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.6526315789473685) internal successors, (157), 122 states have internal predecessors, (157), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:29:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2024-10-24 16:29:35,552 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 17 [2024-10-24 16:29:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:35,552 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2024-10-24 16:29:35,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2024-10-24 16:29:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:29:35,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:35,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:35,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:29:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 16:29:35,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:35,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash 175039610, now seen corresponding path program 1 times [2024-10-24 16:29:35,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:35,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100710757] [2024-10-24 16:29:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:35,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:35,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:29:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:35,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100710757] [2024-10-24 16:29:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100710757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:35,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:29:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976605544] [2024-10-24 16:29:35,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:29:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:29:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:29:35,978 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:36,157 INFO L93 Difference]: Finished difference Result 186 states and 238 transitions. [2024-10-24 16:29:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:29:36,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-24 16:29:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:36,158 INFO L225 Difference]: With dead ends: 186 [2024-10-24 16:29:36,158 INFO L226 Difference]: Without dead ends: 186 [2024-10-24 16:29:36,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:29:36,159 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 157 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:36,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 300 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-24 16:29:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 146. [2024-10-24 16:29:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 130 states have internal predecessors, (167), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:29:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2024-10-24 16:29:36,165 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 18 [2024-10-24 16:29:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:36,165 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2024-10-24 16:29:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2024-10-24 16:29:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:29:36,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:36,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:36,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:29:36,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:36,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1035774396, now seen corresponding path program 1 times [2024-10-24 16:29:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967847307] [2024-10-24 16:29:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:29:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967847307] [2024-10-24 16:29:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967847307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:29:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192705947] [2024-10-24 16:29:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:29:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:29:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:29:36,375 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:36,560 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2024-10-24 16:29:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:29:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 16:29:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:36,563 INFO L225 Difference]: With dead ends: 181 [2024-10-24 16:29:36,564 INFO L226 Difference]: Without dead ends: 181 [2024-10-24 16:29:36,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:29:36,565 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 40 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:36,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 427 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-24 16:29:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-10-24 16:29:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 132 states have internal predecessors, (169), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:29:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 193 transitions. [2024-10-24 16:29:36,572 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 193 transitions. Word has length 20 [2024-10-24 16:29:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:36,572 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 193 transitions. [2024-10-24 16:29:36,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2024-10-24 16:29:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 16:29:36,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:36,575 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:36,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:29:36,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:36,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash -750512035, now seen corresponding path program 1 times [2024-10-24 16:29:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:36,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463636840] [2024-10-24 16:29:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 16:29:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463636840] [2024-10-24 16:29:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463636840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919876186] [2024-10-24 16:29:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:36,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:36,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:36,676 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) [2024-10-24 16:29:36,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 16:29:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:36,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:29:36,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:36,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919876186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:37,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:29:37,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-24 16:29:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050904324] [2024-10-24 16:29:37,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:37,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:29:37,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:29:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:29:37,002 INFO L87 Difference]: Start difference. First operand 148 states and 193 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:29:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:37,466 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2024-10-24 16:29:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:29:37,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2024-10-24 16:29:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:37,468 INFO L225 Difference]: With dead ends: 175 [2024-10-24 16:29:37,468 INFO L226 Difference]: Without dead ends: 173 [2024-10-24 16:29:37,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:29:37,469 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 420 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:37,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 602 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:29:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-24 16:29:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2024-10-24 16:29:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.6) internal successors, (168), 132 states have internal predecessors, (168), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:29:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2024-10-24 16:29:37,475 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 22 [2024-10-24 16:29:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:37,475 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2024-10-24 16:29:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:29:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2024-10-24 16:29:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:29:37,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:37,476 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:37,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 16:29:37,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:37,681 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:37,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1597442883, now seen corresponding path program 1 times [2024-10-24 16:29:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:37,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441952779] [2024-10-24 16:29:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:38,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441952779] [2024-10-24 16:29:38,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441952779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:38,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070249907] [2024-10-24 16:29:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:38,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:38,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:38,079 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) [2024-10-24 16:29:38,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 16:29:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:38,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 16:29:38,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:38,212 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 [2024-10-24 16:29:38,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 16:29:38,325 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 21 treesize of output 9 [2024-10-24 16:29:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:38,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:38,391 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 34 treesize of output 28 [2024-10-24 16:29:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070249907] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:38,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:29:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2024-10-24 16:29:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901780502] [2024-10-24 16:29:38,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:38,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:29:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:38,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:29:38,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:29:38,524 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand has 21 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:39,638 INFO L93 Difference]: Finished difference Result 325 states and 423 transitions. [2024-10-24 16:29:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 16:29:39,638 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-24 16:29:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:39,641 INFO L225 Difference]: With dead ends: 325 [2024-10-24 16:29:39,641 INFO L226 Difference]: Without dead ends: 325 [2024-10-24 16:29:39,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 16:29:39,642 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 253 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:39,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1316 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:29:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-24 16:29:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 198. [2024-10-24 16:29:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.5833333333333333) internal successors, (228), 173 states have internal predecessors, (228), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 16:29:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2024-10-24 16:29:39,653 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 23 [2024-10-24 16:29:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:39,653 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2024-10-24 16:29:39,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2024-10-24 16:29:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:29:39,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:39,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:39,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 16:29:39,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 16:29:39,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:39,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1597442884, now seen corresponding path program 1 times [2024-10-24 16:29:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082664615] [2024-10-24 16:29:39,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082664615] [2024-10-24 16:29:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082664615] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936673883] [2024-10-24 16:29:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:40,215 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) [2024-10-24 16:29:40,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 16:29:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:40,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 16:29:40,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:40,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 16:29:40,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 16:29:40,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-24 16:29:40,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-24 16:29:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:40,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:40,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2024-10-24 16:29:40,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:40,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936673883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:40,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:29:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-24 16:29:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759201053] [2024-10-24 16:29:40,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:40,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:29:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:29:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:29:40,592 INFO L87 Difference]: Start difference. First operand 198 states and 268 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:40,995 INFO L93 Difference]: Finished difference Result 273 states and 357 transitions. [2024-10-24 16:29:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:29:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-24 16:29:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:40,997 INFO L225 Difference]: With dead ends: 273 [2024-10-24 16:29:40,997 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 16:29:40,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:29:40,998 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 316 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:40,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1126 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:29:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 16:29:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 235. [2024-10-24 16:29:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 174 states have (on average 1.5689655172413792) internal successors, (273), 204 states have internal predecessors, (273), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 16:29:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 323 transitions. [2024-10-24 16:29:41,006 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 323 transitions. Word has length 23 [2024-10-24 16:29:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:41,008 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 323 transitions. [2024-10-24 16:29:41,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 323 transitions. [2024-10-24 16:29:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:29:41,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:41,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:41,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 16:29:41,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 16:29:41,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:41,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1647234180, now seen corresponding path program 1 times [2024-10-24 16:29:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:41,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023088859] [2024-10-24 16:29:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:41,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:29:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023088859] [2024-10-24 16:29:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023088859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:41,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065564642] [2024-10-24 16:29:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:41,296 INFO L87 Difference]: Start difference. First operand 235 states and 323 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:41,328 INFO L93 Difference]: Finished difference Result 249 states and 341 transitions. [2024-10-24 16:29:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:41,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-24 16:29:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:41,331 INFO L225 Difference]: With dead ends: 249 [2024-10-24 16:29:41,331 INFO L226 Difference]: Without dead ends: 249 [2024-10-24 16:29:41,331 INFO L431 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 [2024-10-24 16:29:41,332 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 363 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 [2024-10-24 16:29:41,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 363 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:29:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-24 16:29:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2024-10-24 16:29:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 212 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 16:29:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 336 transitions. [2024-10-24 16:29:41,339 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 336 transitions. Word has length 24 [2024-10-24 16:29:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:41,339 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 336 transitions. [2024-10-24 16:29:41,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 336 transitions. [2024-10-24 16:29:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:29:41,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:41,341 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:41,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:29:41,342 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:41,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -812306743, now seen corresponding path program 1 times [2024-10-24 16:29:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:41,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382305941] [2024-10-24 16:29:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 16:29:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382305941] [2024-10-24 16:29:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382305941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:41,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:29:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716108718] [2024-10-24 16:29:41,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:41,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:41,412 INFO L87 Difference]: Start difference. First operand 244 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:41,542 INFO L93 Difference]: Finished difference Result 245 states and 336 transitions. [2024-10-24 16:29:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:41,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-24 16:29:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:41,543 INFO L225 Difference]: With dead ends: 245 [2024-10-24 16:29:41,544 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 16:29:41,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:29:41,544 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 72 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:41,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 148 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 16:29:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-10-24 16:29:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 211 states have internal predecessors, (274), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 16:29:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2024-10-24 16:29:41,552 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 24 [2024-10-24 16:29:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:41,552 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2024-10-24 16:29:41,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2024-10-24 16:29:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:29:41,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:41,553 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:41,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 16:29:41,553 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:41,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash -812306742, now seen corresponding path program 1 times [2024-10-24 16:29:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:41,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115427548] [2024-10-24 16:29:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:41,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 16:29:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:41,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:41,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115427548] [2024-10-24 16:29:41,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115427548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:41,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:41,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:29:41,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487170886] [2024-10-24 16:29:41,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:41,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:41,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:41,676 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:41,873 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2024-10-24 16:29:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:41,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-24 16:29:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:41,875 INFO L225 Difference]: With dead ends: 258 [2024-10-24 16:29:41,875 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 16:29:41,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:29:41,876 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:41,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 327 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 16:29:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 237. [2024-10-24 16:29:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 177 states have (on average 1.497175141242938) internal successors, (265), 205 states have internal predecessors, (265), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 16:29:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2024-10-24 16:29:41,883 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 24 [2024-10-24 16:29:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:41,883 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2024-10-24 16:29:41,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:29:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2024-10-24 16:29:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:29:41,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:41,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:41,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 16:29:41,885 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:41,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1868175622, now seen corresponding path program 1 times [2024-10-24 16:29:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:41,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964465814] [2024-10-24 16:29:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:29:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 16:29:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964465814] [2024-10-24 16:29:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964465814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:41,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:41,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:41,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723545879] [2024-10-24 16:29:41,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:41,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:41,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:41,953 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:29:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:42,114 INFO L93 Difference]: Finished difference Result 250 states and 319 transitions. [2024-10-24 16:29:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-24 16:29:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:42,115 INFO L225 Difference]: With dead ends: 250 [2024-10-24 16:29:42,115 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 16:29:42,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:42,116 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 167 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:42,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 172 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 16:29:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2024-10-24 16:29:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.4350282485875707) internal successors, (254), 202 states have internal predecessors, (254), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 16:29:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 314 transitions. [2024-10-24 16:29:42,125 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 314 transitions. Word has length 26 [2024-10-24 16:29:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:42,125 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 314 transitions. [2024-10-24 16:29:42,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:29:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 314 transitions. [2024-10-24 16:29:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:29:42,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:42,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:42,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 16:29:42,127 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1868175621, now seen corresponding path program 1 times [2024-10-24 16:29:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835289470] [2024-10-24 16:29:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:42,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:29:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:42,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 16:29:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:42,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835289470] [2024-10-24 16:29:42,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835289470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:42,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:42,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763545386] [2024-10-24 16:29:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:42,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:42,238 INFO L87 Difference]: Start difference. First operand 234 states and 314 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:29:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:42,407 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2024-10-24 16:29:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:42,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-24 16:29:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:42,409 INFO L225 Difference]: With dead ends: 247 [2024-10-24 16:29:42,409 INFO L226 Difference]: Without dead ends: 247 [2024-10-24 16:29:42,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:42,409 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 196 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:42,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 158 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-24 16:29:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 234. [2024-10-24 16:29:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 202 states have internal predecessors, (248), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 16:29:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2024-10-24 16:29:42,416 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 26 [2024-10-24 16:29:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:42,416 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2024-10-24 16:29:42,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:29:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2024-10-24 16:29:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:29:42,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:42,417 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:42,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 16:29:42,417 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:29:42,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1979681309, now seen corresponding path program 1 times [2024-10-24 16:29:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027609424] [2024-10-24 16:29:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 16:29:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027609424] [2024-10-24 16:29:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027609424] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174109894] [2024-10-24 16:29:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:43,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:43,192 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) [2024-10-24 16:29:43,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 16:29:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:43,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 16:29:43,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:43,337 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 [2024-10-24 16:29:43,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 16:29:43,485 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 21 treesize of output 9 [2024-10-24 16:29:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:43,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:43,517 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 34 treesize of output 28 [2024-10-24 16:29:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:43,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174109894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:43,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:29:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 6] total 21 [2024-10-24 16:29:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886659139] [2024-10-24 16:29:43,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 16:29:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 16:29:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:29:43,642 INFO L87 Difference]: Start difference. First operand 234 states and 308 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:29:48,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:29:52,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:29:56,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:00,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:00,800 INFO L93 Difference]: Finished difference Result 385 states and 478 transitions. [2024-10-24 16:30:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:30:00,801 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-24 16:30:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:00,802 INFO L225 Difference]: With dead ends: 385 [2024-10-24 16:30:00,802 INFO L226 Difference]: Without dead ends: 385 [2024-10-24 16:30:00,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2024-10-24 16:30:00,803 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 673 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 98 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:00,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 927 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 965 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2024-10-24 16:30:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-24 16:30:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 306. [2024-10-24 16:30:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 29 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 16:30:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 401 transitions. [2024-10-24 16:30:00,813 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 401 transitions. Word has length 26 [2024-10-24 16:30:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:00,813 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 401 transitions. [2024-10-24 16:30:00,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:30:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 401 transitions. [2024-10-24 16:30:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:30:00,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:00,814 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:00,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 16:30:01,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:01,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:30:01,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1979681308, now seen corresponding path program 1 times [2024-10-24 16:30:01,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664978717] [2024-10-24 16:30:01,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 16:30:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:01,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664978717] [2024-10-24 16:30:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664978717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:01,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384069278] [2024-10-24 16:30:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:01,810 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) [2024-10-24 16:30:01,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 16:30:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:01,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:30:01,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:01,951 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 [2024-10-24 16:30:02,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 16:30:02,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 16:30:02,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 21 treesize of output 9 [2024-10-24 16:30:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:02,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:02,351 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 70 treesize of output 64 [2024-10-24 16:30:02,358 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 94 treesize of output 82 [2024-10-24 16:30:02,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:02,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384069278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:02,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:02,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 6] total 24 [2024-10-24 16:30:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362819297] [2024-10-24 16:30:02,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:02,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 16:30:02,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:02,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 16:30:02,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:30:02,434 INFO L87 Difference]: Start difference. First operand 306 states and 401 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:30:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:04,208 INFO L93 Difference]: Finished difference Result 414 states and 510 transitions. [2024-10-24 16:30:04,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:30:04,209 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-10-24 16:30:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:04,210 INFO L225 Difference]: With dead ends: 414 [2024-10-24 16:30:04,210 INFO L226 Difference]: Without dead ends: 414 [2024-10-24 16:30:04,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 16:30:04,212 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 446 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:04,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 987 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 16:30:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-24 16:30:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2024-10-24 16:30:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 250 states have (on average 1.352) internal successors, (338), 281 states have internal predecessors, (338), 47 states have call successors, (47), 18 states have call predecessors, (47), 18 states have return successors, (47), 32 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-24 16:30:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 432 transitions. [2024-10-24 16:30:04,230 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 432 transitions. Word has length 26 [2024-10-24 16:30:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:04,230 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 432 transitions. [2024-10-24 16:30:04,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:30:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 432 transitions. [2024-10-24 16:30:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 16:30:04,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:04,232 INFO L215 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, 1, 1, 1, 1, 1] [2024-10-24 16:30:04,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 16:30:04,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:04,433 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:30:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2081231958, now seen corresponding path program 1 times [2024-10-24 16:30:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:04,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116430395] [2024-10-24 16:30:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:30:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 16:30:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:30:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116430395] [2024-10-24 16:30:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116430395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:04,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:04,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:04,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039162488] [2024-10-24 16:30:04,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:04,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:30:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:04,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:30:04,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:30:04,497 INFO L87 Difference]: Start difference. First operand 332 states and 432 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:30:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:04,540 INFO L93 Difference]: Finished difference Result 333 states and 417 transitions. [2024-10-24 16:30:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:04,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-10-24 16:30:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:04,542 INFO L225 Difference]: With dead ends: 333 [2024-10-24 16:30:04,542 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 16:30:04,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:04,543 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 37 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:04,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 240 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:30:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 16:30:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 320. [2024-10-24 16:30:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 246 states have (on average 1.3414634146341464) internal successors, (330), 273 states have internal predecessors, (330), 39 states have call successors, (39), 18 states have call predecessors, (39), 18 states have return successors, (39), 28 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 16:30:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 408 transitions. [2024-10-24 16:30:04,552 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 408 transitions. Word has length 30 [2024-10-24 16:30:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:04,552 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 408 transitions. [2024-10-24 16:30:04,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:30:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 408 transitions. [2024-10-24 16:30:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:30:04,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:04,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:04,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 16:30:04,553 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:30:04,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash -633640057, now seen corresponding path program 1 times [2024-10-24 16:30:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141608489] [2024-10-24 16:30:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 16:30:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 16:30:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:04,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141608489] [2024-10-24 16:30:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141608489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:04,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:04,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:30:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972781160] [2024-10-24 16:30:04,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:04,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:04,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:04,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:04,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:04,757 INFO L87 Difference]: Start difference. First operand 320 states and 408 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:30:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:04,895 INFO L93 Difference]: Finished difference Result 340 states and 431 transitions. [2024-10-24 16:30:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:30:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-24 16:30:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:04,897 INFO L225 Difference]: With dead ends: 340 [2024-10-24 16:30:04,898 INFO L226 Difference]: Without dead ends: 340 [2024-10-24 16:30:04,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:04,898 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 110 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:04,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 284 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-24 16:30:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 326. [2024-10-24 16:30:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 251 states have (on average 1.3306772908366533) internal successors, (334), 278 states have internal predecessors, (334), 40 states have call successors, (40), 18 states have call predecessors, (40), 18 states have return successors, (40), 29 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 16:30:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 414 transitions. [2024-10-24 16:30:04,908 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 414 transitions. Word has length 29 [2024-10-24 16:30:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:04,909 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 414 transitions. [2024-10-24 16:30:04,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:30:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 414 transitions. [2024-10-24 16:30:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:30:04,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:04,910 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 16:30:04,910 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-24 16:30:04,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1871398323, now seen corresponding path program 1 times [2024-10-24 16:30:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978714093] [2024-10-24 16:30:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:05,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 16:30:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:05,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978714093] [2024-10-24 16:30:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978714093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:05,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278444657] [2024-10-24 16:30:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:05,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:05,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:30:05,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 16:30:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:05,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:30:05,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:05,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 16:30:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:05,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:05,540 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 32 treesize of output 26 [2024-10-24 16:30:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278444657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:05,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-10-24 16:30:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118432610] [2024-10-24 16:30:05,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 16:30:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 16:30:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:30:05,572 INFO L87 Difference]: Start difference. First operand 326 states and 414 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:30:09,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:13,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:17,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:21,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:25,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:29,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:33,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:37,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:41,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:45,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:49,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:53,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:30:57,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:31:01,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]