./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 18:10:29,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:10:29,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:10:29,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:10:29,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:10:29,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:10:29,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:10:29,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:10:29,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:10:29,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:10:29,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:10:29,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:10:29,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:10:29,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:10:29,555 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:10:29,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:10:29,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:10:29,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:10:29,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:10:29,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:10:29,557 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:10:29,557 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:10:29,558 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:10:29,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:10:29,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:10:29,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:10:29,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:10:29,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:10:29,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:10:29,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:10:29,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:10:29,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:10:29,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:10:29,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:10:29,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:10:29,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:10:29,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:10:29,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:10:29,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:10:29,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:10:29,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:10:29,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:10:29,565 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-clean/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-clean/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-11 18:10:29,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:10:29,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:10:29,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:10:29,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:10:29,846 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:10:29,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-10-11 18:10:31,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:10:31,701 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:10:31,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-10-11 18:10:31,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d3bb1d08/0e632c8607974c5c8885683ddbd49ea8/FLAGfca4e9b29 [2024-10-11 18:10:31,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d3bb1d08/0e632c8607974c5c8885683ddbd49ea8 [2024-10-11 18:10:31,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:10:31,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:10:31,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:10:31,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:10:31,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:10:31,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:10:31" (1/1) ... [2024-10-11 18:10:31,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1037acf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:31, skipping insertion in model container [2024-10-11 18:10:31,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:10:31" (1/1) ... [2024-10-11 18:10:31,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:10:32,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:10:32,188 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:10:32,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:10:32,285 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:10:32,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32 WrapperNode [2024-10-11 18:10:32,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:10:32,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:10:32,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:10:32,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:10:32,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,343 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-10-11 18:10:32,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:10:32,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:10:32,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:10:32,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:10:32,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,402 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-11 18:10:32,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:10:32,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:10:32,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:10:32,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:10:32,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (1/1) ... [2024-10-11 18:10:32,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:10:32,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:32,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:10:32,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:10:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-10-11 18:10:32,549 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-10-11 18:10:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 18:10:32,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 18:10:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:10:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:10:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:10:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:10:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:10:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:10:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:10:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:10:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:10:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:10:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:10:32,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:10:32,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:10:32,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:10:33,015 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-11 18:10:33,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:10:33,050 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:10:33,052 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:10:33,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:10:33 BoogieIcfgContainer [2024-10-11 18:10:33,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:10:33,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:10:33,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:10:33,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:10:33,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:10:31" (1/3) ... [2024-10-11 18:10:33,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a178de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:10:33, skipping insertion in model container [2024-10-11 18:10:33,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:10:32" (2/3) ... [2024-10-11 18:10:33,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a178de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:10:33, skipping insertion in model container [2024-10-11 18:10:33,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:10:33" (3/3) ... [2024-10-11 18:10:33,064 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-10-11 18:10:33,081 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:10:33,082 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 18:10:33,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:10:33,139 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;@18235f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:10:33,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-11 18:10:33,144 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-11 18:10:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:10:33,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:33,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:10:33,152 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-11 18:10:33,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash 6904, now seen corresponding path program 1 times [2024-10-11 18:10:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164199548] [2024-10-11 18:10:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:33,413 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-11 18:10:33,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164199548] [2024-10-11 18:10:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164199548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:33,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:10:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374476149] [2024-10-11 18:10:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:33,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:33,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:33,457 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-11 18:10:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:33,613 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-10-11 18:10:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:33,616 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-11 18:10:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:33,625 INFO L225 Difference]: With dead ends: 102 [2024-10-11 18:10:33,627 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:10:33,630 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-11 18:10:33,636 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-11 18:10:33,637 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-11 18:10:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:10:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:10:33,679 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-11 18:10:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-10-11 18:10:33,682 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 2 [2024-10-11 18:10:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:33,683 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-10-11 18:10:33,683 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-11 18:10:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-10-11 18:10:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:10:33,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:33,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:10:33,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:10:33,684 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-11 18:10:33,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 6905, now seen corresponding path program 1 times [2024-10-11 18:10:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:33,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959898395] [2024-10-11 18:10:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:33,873 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-11 18:10:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:33,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959898395] [2024-10-11 18:10:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959898395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:33,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:10:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905752824] [2024-10-11 18:10:33,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:33,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:33,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:33,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:33,876 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-11 18:10:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:33,985 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-11 18:10:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:33,986 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-11 18:10:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:33,987 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:10:33,987 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:10:33,987 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-11 18:10:33,990 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-11 18:10:33,991 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-11 18:10:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:10:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 18:10:34,001 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-11 18:10:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-11 18:10:34,004 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 2 [2024-10-11 18:10:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:34,004 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-11 18:10:34,004 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-11 18:10:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-11 18:10:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:10:34,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:34,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:34,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:10:34,006 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-11 18:10:34,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash 233145900, now seen corresponding path program 1 times [2024-10-11 18:10:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872961634] [2024-10-11 18:10:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:34,076 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-11 18:10:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872961634] [2024-10-11 18:10:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872961634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986719746] [2024-10-11 18:10:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:34,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:34,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:34,081 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-11 18:10:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:34,149 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2024-10-11 18:10:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:34,150 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-11 18:10:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:34,151 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:10:34,151 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:10:34,151 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-11 18:10:34,152 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-11 18:10:34,153 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-11 18:10:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:10:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-11 18:10:34,159 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-11 18:10:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-10-11 18:10:34,160 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 7 [2024-10-11 18:10:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:34,161 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-10-11 18:10:34,161 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-11 18:10:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-10-11 18:10:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:10:34,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:34,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:34,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:10:34,162 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-11 18:10:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 233145901, now seen corresponding path program 1 times [2024-10-11 18:10:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415707837] [2024-10-11 18:10:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:34,345 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-11 18:10:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415707837] [2024-10-11 18:10:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415707837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:34,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:34,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775347445] [2024-10-11 18:10:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:34,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:10:34,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:34,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:10:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:10:34,350 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-11 18:10:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:34,428 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2024-10-11 18:10:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:10:34,429 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-11 18:10:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:34,430 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:10:34,430 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:10:34,430 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-11 18:10:34,433 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-11 18:10:34,433 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-11 18:10:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:10:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-11 18:10:34,441 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-11 18:10:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-11 18:10:34,447 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 7 [2024-10-11 18:10:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:34,447 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-11 18:10:34,447 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-11 18:10:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-11 18:10:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:10:34,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:34,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:34,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:10:34,448 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-11 18:10:34,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:34,449 INFO L85 PathProgramCache]: Analyzing trace with hash 717072888, now seen corresponding path program 1 times [2024-10-11 18:10:34,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:34,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206564941] [2024-10-11 18:10:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:34,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:34,623 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-11 18:10:34,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206564941] [2024-10-11 18:10:34,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206564941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:34,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420858098] [2024-10-11 18:10:34,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:34,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:34,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:34,630 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-11 18:10:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:34,737 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2024-10-11 18:10:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:34,738 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-11 18:10:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:34,740 INFO L225 Difference]: With dead ends: 169 [2024-10-11 18:10:34,740 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 18:10:34,740 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-11 18:10:34,741 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-11 18:10:34,745 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-11 18:10:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 18:10:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 137. [2024-10-11 18:10:34,759 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-11 18:10:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2024-10-11 18:10:34,760 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 9 [2024-10-11 18:10:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:34,761 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2024-10-11 18:10:34,761 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-11 18:10:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2024-10-11 18:10:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:10:34,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:34,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:34,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:10:34,762 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-11 18:10:34,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash 714911023, now seen corresponding path program 1 times [2024-10-11 18:10:34,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855309466] [2024-10-11 18:10:34,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:34,919 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-11 18:10:34,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:34,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855309466] [2024-10-11 18:10:34,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855309466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:34,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:34,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:34,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343665673] [2024-10-11 18:10:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:34,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:34,924 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-11 18:10:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:35,033 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-10-11 18:10:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:10:35,034 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-11 18:10:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:35,039 INFO L225 Difference]: With dead ends: 136 [2024-10-11 18:10:35,040 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 18:10:35,040 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-11 18:10:35,041 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-11 18:10:35,041 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-11 18:10:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 18:10:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-11 18:10:35,054 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-11 18:10:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2024-10-11 18:10:35,056 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 9 [2024-10-11 18:10:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:35,056 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2024-10-11 18:10:35,057 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-11 18:10:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-10-11 18:10:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:10:35,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:35,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:35,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:10:35,061 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-11 18:10:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 714911024, now seen corresponding path program 1 times [2024-10-11 18:10:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871326868] [2024-10-11 18:10:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:35,228 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-11 18:10:35,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871326868] [2024-10-11 18:10:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871326868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:35,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:10:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568069231] [2024-10-11 18:10:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:10:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:10:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:10:35,231 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-11 18:10:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:35,342 INFO L93 Difference]: Finished difference Result 135 states and 187 transitions. [2024-10-11 18:10:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:35,342 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-11 18:10:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:35,343 INFO L225 Difference]: With dead ends: 135 [2024-10-11 18:10:35,344 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 18:10:35,344 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-11 18:10:35,345 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-11 18:10:35,345 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-11 18:10:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 18:10:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-11 18:10:35,351 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-11 18:10:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 187 transitions. [2024-10-11 18:10:35,352 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 187 transitions. Word has length 9 [2024-10-11 18:10:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:35,352 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 187 transitions. [2024-10-11 18:10:35,352 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-11 18:10:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 187 transitions. [2024-10-11 18:10:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:10:35,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:35,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:10:35,354 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-11 18:10:35,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -177375370, now seen corresponding path program 1 times [2024-10-11 18:10:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290718332] [2024-10-11 18:10:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:10:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:35,442 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-11 18:10:35,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:35,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290718332] [2024-10-11 18:10:35,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290718332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:35,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:35,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:35,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146195647] [2024-10-11 18:10:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:35,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:35,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:35,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:35,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:35,446 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-11 18:10:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:35,646 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2024-10-11 18:10:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:35,647 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-11 18:10:35,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:35,647 INFO L225 Difference]: With dead ends: 156 [2024-10-11 18:10:35,648 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 18:10:35,648 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-11 18:10:35,648 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-11 18:10:35,649 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-11 18:10:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 18:10:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2024-10-11 18:10:35,661 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-11 18:10:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-10-11 18:10:35,666 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 14 [2024-10-11 18:10:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:35,666 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-10-11 18:10:35,667 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-11 18:10:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-10-11 18:10:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:10:35,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:35,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:35,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:10:35,667 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-11 18:10:35,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -177375369, now seen corresponding path program 1 times [2024-10-11 18:10:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596696712] [2024-10-11 18:10:35,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:10:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:35,836 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-11 18:10:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596696712] [2024-10-11 18:10:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596696712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960578840] [2024-10-11 18:10:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:35,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:35,843 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-11 18:10:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:36,131 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2024-10-11 18:10:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:36,131 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-11 18:10:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:36,132 INFO L225 Difference]: With dead ends: 151 [2024-10-11 18:10:36,133 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 18:10:36,133 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-11 18:10:36,134 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-11 18:10:36,134 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-11 18:10:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 18:10:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2024-10-11 18:10:36,140 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-11 18:10:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2024-10-11 18:10:36,141 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 14 [2024-10-11 18:10:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:36,141 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2024-10-11 18:10:36,141 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-11 18:10:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2024-10-11 18:10:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:10:36,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:36,142 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:36,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:10:36,143 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-11 18:10:36,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2103323471, now seen corresponding path program 1 times [2024-10-11 18:10:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:36,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316904539] [2024-10-11 18:10:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:36,238 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-11 18:10:36,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:36,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316904539] [2024-10-11 18:10:36,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316904539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:36,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621630817] [2024-10-11 18:10:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:36,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:36,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:36,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:36,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:10:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:36,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:10:36,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:36,419 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-11 18:10:36,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:36,489 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:10:36,490 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-11 18:10:36,507 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-11 18:10:36,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621630817] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:36,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-11 18:10:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027778216] [2024-10-11 18:10:36,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:36,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:36,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:36,510 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-11 18:10:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:36,693 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2024-10-11 18:10:36,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:10:36,694 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-11 18:10:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:36,695 INFO L225 Difference]: With dead ends: 144 [2024-10-11 18:10:36,695 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 18:10:36,696 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-11 18:10:36,697 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:36,697 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.2s Time] [2024-10-11 18:10:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 18:10:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2024-10-11 18:10:36,705 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-11 18:10:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2024-10-11 18:10:36,707 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 17 [2024-10-11 18:10:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:36,707 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2024-10-11 18:10:36,707 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-11 18:10:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2024-10-11 18:10:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:10:36,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:36,710 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:10:36,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:10:36,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:10:36,911 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-11 18:10:36,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2103323470, now seen corresponding path program 1 times [2024-10-11 18:10:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284336186] [2024-10-11 18:10:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:37,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-11 18:10:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284336186] [2024-10-11 18:10:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284336186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:37,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257777640] [2024-10-11 18:10:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:37,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:37,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:37,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:37,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:10:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:37,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:10:37,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:37,234 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-11 18:10:37,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:10:37,299 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-11 18:10:37,409 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-11 18:10:37,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:37,649 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-11 18:10:37,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257777640] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:37,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:37,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2024-10-11 18:10:37,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567101585] [2024-10-11 18:10:37,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:37,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:10:37,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:37,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:10:37,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:10:37,654 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-11 18:10:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:38,017 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2024-10-11 18:10:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:10:38,019 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-11 18:10:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:38,020 INFO L225 Difference]: With dead ends: 142 [2024-10-11 18:10:38,020 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 18:10:38,020 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-11 18:10:38,021 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 315 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-11 18:10:38,021 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-11 18:10:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 18:10:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2024-10-11 18:10:38,029 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-11 18:10:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2024-10-11 18:10:38,030 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 17 [2024-10-11 18:10:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:38,030 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2024-10-11 18:10:38,030 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-11 18:10:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2024-10-11 18:10:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:10:38,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:38,031 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-11 18:10:38,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:10:38,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:38,236 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-11 18:10:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash 175039610, now seen corresponding path program 1 times [2024-10-11 18:10:38,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:38,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424970718] [2024-10-11 18:10:38,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:10:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:38,488 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-11 18:10:38,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424970718] [2024-10-11 18:10:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424970718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:38,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:38,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:10:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540455963] [2024-10-11 18:10:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:10:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:38,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:10:38,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:38,491 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-11 18:10:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:38,663 INFO L93 Difference]: Finished difference Result 186 states and 238 transitions. [2024-10-11 18:10:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:10:38,664 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-11 18:10:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:38,665 INFO L225 Difference]: With dead ends: 186 [2024-10-11 18:10:38,665 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 18:10:38,665 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-11 18:10:38,666 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-11 18:10:38,666 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-11 18:10:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 18:10:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 146. [2024-10-11 18:10:38,671 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-11 18:10:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2024-10-11 18:10:38,672 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 18 [2024-10-11 18:10:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:38,672 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2024-10-11 18:10:38,672 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-11 18:10:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2024-10-11 18:10:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:10:38,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:38,673 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-11 18:10:38,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:10:38,674 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-11 18:10:38,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1035774396, now seen corresponding path program 1 times [2024-10-11 18:10:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:38,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332169724] [2024-10-11 18:10:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:10:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:38,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-11 18:10:38,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:38,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332169724] [2024-10-11 18:10:38,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332169724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:38,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:10:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459535916] [2024-10-11 18:10:38,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:38,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:10:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:10:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:10:38,854 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-11 18:10:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:39,054 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2024-10-11 18:10:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:10:39,055 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-11 18:10:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:39,057 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:10:39,057 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:10:39,058 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-11 18:10:39,058 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:39,058 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.2s Time] [2024-10-11 18:10:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:10:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-10-11 18:10:39,066 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-11 18:10:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 193 transitions. [2024-10-11 18:10:39,068 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 193 transitions. Word has length 20 [2024-10-11 18:10:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:39,069 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 193 transitions. [2024-10-11 18:10:39,070 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-11 18:10:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2024-10-11 18:10:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:10:39,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:39,072 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-11 18:10:39,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:10:39,072 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-11 18:10:39,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash -750512035, now seen corresponding path program 1 times [2024-10-11 18:10:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330216601] [2024-10-11 18:10:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:10:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:39,172 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-11 18:10:39,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:39,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330216601] [2024-10-11 18:10:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330216601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:39,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306002403] [2024-10-11 18:10:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:39,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:39,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:39,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:39,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:10:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:39,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:10:39,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:39,377 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-11 18:10:39,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:39,520 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-11 18:10:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306002403] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:39,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-11 18:10:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530783846] [2024-10-11 18:10:39,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:39,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:10:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:10:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:10:39,523 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-11 18:10:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:40,002 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2024-10-11 18:10:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:10:40,003 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-11 18:10:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:40,004 INFO L225 Difference]: With dead ends: 175 [2024-10-11 18:10:40,004 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 18:10:40,004 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-11 18:10:40,005 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-11 18:10:40,005 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-11 18:10:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 18:10:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2024-10-11 18:10:40,010 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-11 18:10:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2024-10-11 18:10:40,011 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 22 [2024-10-11 18:10:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:40,011 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2024-10-11 18:10:40,011 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-11 18:10:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2024-10-11 18:10:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:10:40,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:40,012 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-11 18:10:40,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:10:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:40,213 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-11 18:10:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1597442883, now seen corresponding path program 1 times [2024-10-11 18:10:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769259364] [2024-10-11 18:10:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:40,552 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-11 18:10:40,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:40,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769259364] [2024-10-11 18:10:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769259364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:40,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34125234] [2024-10-11 18:10:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:40,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:40,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:40,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:10:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:40,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:10:40,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:40,687 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-11 18:10:40,734 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-11 18:10:40,806 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-11 18:10:40,840 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-11 18:10:40,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:40,873 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-11 18:10:40,983 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-11 18:10:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34125234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:40,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2024-10-11 18:10:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516361901] [2024-10-11 18:10:40,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:40,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:10:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:40,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:10:40,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:10:40,985 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-11 18:10:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:42,115 INFO L93 Difference]: Finished difference Result 325 states and 423 transitions. [2024-10-11 18:10:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 18:10:42,116 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-11 18:10:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:42,119 INFO L225 Difference]: With dead ends: 325 [2024-10-11 18:10:42,119 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 18:10:42,120 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-11 18:10:42,120 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-11 18:10:42,120 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-11 18:10:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 18:10:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 198. [2024-10-11 18:10:42,132 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-11 18:10:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2024-10-11 18:10:42,135 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 23 [2024-10-11 18:10:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:42,135 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2024-10-11 18:10:42,135 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-11 18:10:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2024-10-11 18:10:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:10:42,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:42,137 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-11 18:10:42,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:10:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:10:42,338 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-11 18:10:42,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1597442884, now seen corresponding path program 1 times [2024-10-11 18:10:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487369211] [2024-10-11 18:10:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,867 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-11 18:10:42,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487369211] [2024-10-11 18:10:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487369211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789831947] [2024-10-11 18:10:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:42,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:42,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:42,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:42,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:10:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:42,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 18:10:42,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:43,015 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-11 18:10:43,021 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-11 18:10:43,122 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-11 18:10:43,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-11 18:10:43,139 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-11 18:10:43,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:43,200 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-11 18:10:43,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:10:43,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:10:43,225 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-11 18:10:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789831947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:43,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-11 18:10:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912083081] [2024-10-11 18:10:43,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:43,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:10:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:10:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:10:43,227 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-11 18:10:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:43,722 INFO L93 Difference]: Finished difference Result 273 states and 357 transitions. [2024-10-11 18:10:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:10:43,723 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-11 18:10:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:43,724 INFO L225 Difference]: With dead ends: 273 [2024-10-11 18:10:43,724 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 18:10:43,725 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-11 18:10:43,725 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:10:43,725 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.4s Time] [2024-10-11 18:10:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 18:10:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 235. [2024-10-11 18:10:43,735 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-11 18:10:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 323 transitions. [2024-10-11 18:10:43,737 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 323 transitions. Word has length 23 [2024-10-11 18:10:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:43,737 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 323 transitions. [2024-10-11 18:10:43,737 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-11 18:10:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 323 transitions. [2024-10-11 18:10:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:10:43,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:43,738 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-11 18:10:43,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:10:43,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:10:43,944 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-11 18:10:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1647234180, now seen corresponding path program 1 times [2024-10-11 18:10:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721649670] [2024-10-11 18:10:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:10:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,041 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-11 18:10:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721649670] [2024-10-11 18:10:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721649670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:44,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:44,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616567435] [2024-10-11 18:10:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:44,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:44,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:44,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:44,042 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-11 18:10:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:44,071 INFO L93 Difference]: Finished difference Result 249 states and 341 transitions. [2024-10-11 18:10:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:44,072 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-11 18:10:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:44,073 INFO L225 Difference]: With dead ends: 249 [2024-10-11 18:10:44,073 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 18:10:44,073 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-11 18:10:44,074 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-11 18:10:44,074 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-11 18:10:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 18:10:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2024-10-11 18:10:44,080 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-11 18:10:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 336 transitions. [2024-10-11 18:10:44,081 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 336 transitions. Word has length 24 [2024-10-11 18:10:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:44,081 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 336 transitions. [2024-10-11 18:10:44,081 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-11 18:10:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 336 transitions. [2024-10-11 18:10:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:10:44,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:44,082 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-11 18:10:44,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:10:44,082 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-11 18:10:44,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash -812306743, now seen corresponding path program 1 times [2024-10-11 18:10:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:44,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361403924] [2024-10-11 18:10:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:10:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,144 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-11 18:10:44,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:44,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361403924] [2024-10-11 18:10:44,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361403924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:44,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:44,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:44,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132279106] [2024-10-11 18:10:44,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:44,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:44,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:44,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:44,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:44,146 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-11 18:10:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:44,268 INFO L93 Difference]: Finished difference Result 245 states and 336 transitions. [2024-10-11 18:10:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:10:44,269 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-11 18:10:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:44,270 INFO L225 Difference]: With dead ends: 245 [2024-10-11 18:10:44,270 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 18:10:44,270 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-11 18:10:44,271 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-11 18:10:44,271 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-11 18:10:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 18:10:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-10-11 18:10:44,277 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-11 18:10:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2024-10-11 18:10:44,278 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 24 [2024-10-11 18:10:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:44,279 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2024-10-11 18:10:44,279 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-11 18:10:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2024-10-11 18:10:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:10:44,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:44,280 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-11 18:10:44,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:10:44,280 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-11 18:10:44,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash -812306742, now seen corresponding path program 1 times [2024-10-11 18:10:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646239552] [2024-10-11 18:10:44,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:10:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,397 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-11 18:10:44,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:44,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646239552] [2024-10-11 18:10:44,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646239552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:44,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:44,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:10:44,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603552645] [2024-10-11 18:10:44,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:44,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:10:44,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:44,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:10:44,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:10:44,398 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-11 18:10:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:44,600 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2024-10-11 18:10:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:44,601 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-11 18:10:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:44,602 INFO L225 Difference]: With dead ends: 258 [2024-10-11 18:10:44,602 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 18:10:44,602 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-11 18:10:44,603 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-11 18:10:44,603 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-11 18:10:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 18:10:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 237. [2024-10-11 18:10:44,609 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-11 18:10:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2024-10-11 18:10:44,610 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 24 [2024-10-11 18:10:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:44,611 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2024-10-11 18:10:44,611 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-11 18:10:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2024-10-11 18:10:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:10:44,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:44,612 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-11 18:10:44,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:10:44,612 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-11 18:10:44,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1868175622, now seen corresponding path program 1 times [2024-10-11 18:10:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332324275] [2024-10-11 18:10:44,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:10:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:10:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,674 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-11 18:10:44,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:44,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332324275] [2024-10-11 18:10:44,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332324275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:44,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:44,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059045761] [2024-10-11 18:10:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:44,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:44,677 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-11 18:10:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:44,849 INFO L93 Difference]: Finished difference Result 250 states and 319 transitions. [2024-10-11 18:10:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:44,849 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-11 18:10:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:44,851 INFO L225 Difference]: With dead ends: 250 [2024-10-11 18:10:44,851 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 18:10:44,851 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-11 18:10:44,852 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-11 18:10:44,852 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-11 18:10:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 18:10:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2024-10-11 18:10:44,861 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-11 18:10:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 314 transitions. [2024-10-11 18:10:44,862 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 314 transitions. Word has length 26 [2024-10-11 18:10:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 314 transitions. [2024-10-11 18:10:44,864 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-11 18:10:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 314 transitions. [2024-10-11 18:10:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:10:44,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:44,864 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-11 18:10:44,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 18:10:44,865 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-11 18:10:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1868175621, now seen corresponding path program 1 times [2024-10-11 18:10:44,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544204158] [2024-10-11 18:10:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:10:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:10:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:45,003 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-11 18:10:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544204158] [2024-10-11 18:10:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544204158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:10:45,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:10:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:10:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627043620] [2024-10-11 18:10:45,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:10:45,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:10:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:10:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:10:45,005 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-11 18:10:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:10:45,180 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2024-10-11 18:10:45,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:10:45,180 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-11 18:10:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:10:45,182 INFO L225 Difference]: With dead ends: 247 [2024-10-11 18:10:45,182 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 18:10:45,182 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-11 18:10:45,182 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-11 18:10:45,183 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-11 18:10:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 18:10:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 234. [2024-10-11 18:10:45,192 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-11 18:10:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2024-10-11 18:10:45,193 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 26 [2024-10-11 18:10:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:10:45,194 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2024-10-11 18:10:45,194 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-11 18:10:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2024-10-11 18:10:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:10:45,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:10:45,194 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-11 18:10:45,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:10:45,195 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-11 18:10:45,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:10:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1979681309, now seen corresponding path program 1 times [2024-10-11 18:10:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:10:45,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012536470] [2024-10-11 18:10:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:10:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:10:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:45,950 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-11 18:10:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:10:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012536470] [2024-10-11 18:10:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012536470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:10:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951521704] [2024-10-11 18:10:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:10:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:10:45,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:10:45,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:10:45,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:10:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:10:46,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:10:46,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:10:46,126 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-11 18:10:46,170 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-11 18:10:46,283 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-11 18:10:46,286 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-11 18:10:46,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:10:46,313 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-11 18:10:46,417 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-11 18:10:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951521704] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:10:46,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:10:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 6] total 21 [2024-10-11 18:10:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491946956] [2024-10-11 18:10:46,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:10:46,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:10:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:10:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:10:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:10:46,419 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-11 18:10:51,201 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-11 18:10:55,303 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-11 18:10:59,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:11:03,427 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-11 18:11:07,469 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-11 18:11:11,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:11:15,550 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-11 18:11:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:15,759 INFO L93 Difference]: Finished difference Result 385 states and 478 transitions. [2024-10-11 18:11:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:11:15,762 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-11 18:11:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:15,764 INFO L225 Difference]: With dead ends: 385 [2024-10-11 18:11:15,764 INFO L226 Difference]: Without dead ends: 385 [2024-10-11 18:11:15,766 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-11 18:11:15,767 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 673 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 98 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:15,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 927 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 966 Invalid, 7 Unknown, 0 Unchecked, 29.0s Time] [2024-10-11 18:11:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-11 18:11:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 306. [2024-10-11 18:11:15,776 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-11 18:11:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 401 transitions. [2024-10-11 18:11:15,777 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 401 transitions. Word has length 26 [2024-10-11 18:11:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:15,777 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 401 transitions. [2024-10-11 18:11:15,778 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-11 18:11:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 401 transitions. [2024-10-11 18:11:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:11:15,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:15,779 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-11 18:11:15,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:11:15,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 18:11:15,979 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-11 18:11:15,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1979681308, now seen corresponding path program 1 times [2024-10-11 18:11:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841877565] [2024-10-11 18:11:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:16,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:11:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:16,943 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-11 18:11:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:16,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841877565] [2024-10-11 18:11:16,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841877565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:16,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601284003] [2024-10-11 18:11:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:16,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:16,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:16,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:16,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:11:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:17,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:11:17,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:17,159 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-11 18:11:17,213 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-11 18:11:17,218 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-11 18:11:17,438 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-11 18:11:17,471 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-11 18:11:17,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:17,599 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-11 18:11:17,603 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-11 18:11:17,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:17,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:11:17,681 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-11 18:11:17,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601284003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:17,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:17,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 6] total 24 [2024-10-11 18:11:17,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149850786] [2024-10-11 18:11:17,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:17,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 18:11:17,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:17,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 18:11:17,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:11:17,684 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-11 18:11:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:19,426 INFO L93 Difference]: Finished difference Result 414 states and 510 transitions. [2024-10-11 18:11:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:11:19,427 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-11 18:11:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:19,429 INFO L225 Difference]: With dead ends: 414 [2024-10-11 18:11:19,429 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 18:11:19,430 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-11 18:11:19,430 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 446 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:11:19,430 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.1s Time] [2024-10-11 18:11:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 18:11:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2024-10-11 18:11:19,445 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-11 18:11:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 432 transitions. [2024-10-11 18:11:19,447 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 432 transitions. Word has length 26 [2024-10-11 18:11:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:19,447 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 432 transitions. [2024-10-11 18:11:19,447 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-11 18:11:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 432 transitions. [2024-10-11 18:11:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:11:19,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:19,448 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-11 18:11:19,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:11:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:19,649 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-11 18:11:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2081231958, now seen corresponding path program 1 times [2024-10-11 18:11:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868099731] [2024-10-11 18:11:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:19,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:11:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:11:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:19,729 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-11 18:11:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868099731] [2024-10-11 18:11:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868099731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:11:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269451225] [2024-10-11 18:11:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:11:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:19,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:11:19,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:11:19,733 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-11 18:11:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:19,780 INFO L93 Difference]: Finished difference Result 333 states and 417 transitions. [2024-10-11 18:11:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:11:19,783 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-11 18:11:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:19,785 INFO L225 Difference]: With dead ends: 333 [2024-10-11 18:11:19,785 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 18:11:19,785 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-11 18:11:19,786 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-11 18:11:19,786 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-11 18:11:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 18:11:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 320. [2024-10-11 18:11:19,799 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-11 18:11:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 408 transitions. [2024-10-11 18:11:19,801 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 408 transitions. Word has length 30 [2024-10-11 18:11:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:19,801 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 408 transitions. [2024-10-11 18:11:19,802 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-11 18:11:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 408 transitions. [2024-10-11 18:11:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:11:19,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:19,803 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-11 18:11:19,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:11:19,803 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-11 18:11:19,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash -633640057, now seen corresponding path program 1 times [2024-10-11 18:11:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:19,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807226905] [2024-10-11 18:11:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 18:11:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:20,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:11:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:20,057 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-11 18:11:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807226905] [2024-10-11 18:11:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807226905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:11:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:11:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:11:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846491758] [2024-10-11 18:11:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:11:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:11:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:11:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:11:20,060 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-11 18:11:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:11:20,217 INFO L93 Difference]: Finished difference Result 340 states and 431 transitions. [2024-10-11 18:11:20,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:11:20,218 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-11 18:11:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:11:20,220 INFO L225 Difference]: With dead ends: 340 [2024-10-11 18:11:20,220 INFO L226 Difference]: Without dead ends: 340 [2024-10-11 18:11:20,220 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-11 18:11:20,221 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-11 18:11:20,221 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-11 18:11:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-11 18:11:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 326. [2024-10-11 18:11:20,234 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-11 18:11:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 414 transitions. [2024-10-11 18:11:20,235 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 414 transitions. Word has length 29 [2024-10-11 18:11:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:11:20,236 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 414 transitions. [2024-10-11 18:11:20,236 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-11 18:11:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 414 transitions. [2024-10-11 18:11:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:11:20,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:11:20,237 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-11 18:11:20,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:11:20,238 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-11 18:11:20,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:11:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1871398323, now seen corresponding path program 1 times [2024-10-11 18:11:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:11:20,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163203376] [2024-10-11 18:11:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:11:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:11:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:20,496 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-11 18:11:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:11:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163203376] [2024-10-11 18:11:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163203376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:11:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867668719] [2024-10-11 18:11:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:11:20,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:11:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:11:20,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:11:20,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:11:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:11:20,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:11:20,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:11:20,684 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-11 18:11:20,809 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-11 18:11:20,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:11:20,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-10-11 18:11:20,936 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-11 18:11:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867668719] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:11:20,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:11:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-10-11 18:11:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931072916] [2024-10-11 18:11:20,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:11:20,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:11:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:11:20,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:11:20,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:11:20,939 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-11 18:11:24,945 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-11 18:11:28,956 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-11 18:11:32,973 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-11 18:11:37,015 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-11 18:11:41,034 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-11 18:11:45,103 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-11 18:11:49,122 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-11 18:11:53,245 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-11 18:11:57,275 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-11 18:12:01,299 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-11 18:12:05,316 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]