./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:29:47,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:29:47,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:29:47,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:29:47,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:29:47,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:29:47,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:29:47,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:29:47,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:29:47,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:29:47,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:29:47,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:29:47,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:29:47,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:29:47,620 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:29:47,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:29:47,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:29:47,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:29:47,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:29:47,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:29:47,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:29:47,623 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:29:47,623 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:29:47,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:29:47,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:29:47,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:29:47,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:29:47,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:29:47,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:29:47,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:29:47,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:29:47,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:29:47,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:29:47,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:29:47,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:29:47,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:29:47,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:29:47,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:29:47,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:29:47,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:29:47,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:29:47,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:29:47,630 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2024-11-17 00:29:47,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:29:47,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:29:47,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:29:47,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:29:47,919 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:29:47,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2024-11-17 00:29:49,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:29:49,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:29:49,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2024-11-17 00:29:49,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03e53c251/a54a168fc6d24e2e904b4ae186151698/FLAGb273d8ea1 [2024-11-17 00:29:49,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03e53c251/a54a168fc6d24e2e904b4ae186151698 [2024-11-17 00:29:49,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:29:49,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:29:49,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:29:49,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:29:49,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:29:49,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:29:49" (1/1) ... [2024-11-17 00:29:49,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c343bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:49, skipping insertion in model container [2024-11-17 00:29:49,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:29:49" (1/1) ... [2024-11-17 00:29:49,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:29:50,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:29:50,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:29:50,091 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:29:50,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:29:50,167 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:29:50,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50 WrapperNode [2024-11-17 00:29:50,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:29:50,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:29:50,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:29:50,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:29:50,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,212 INFO L138 Inliner]: procedures = 124, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 165 [2024-11-17 00:29:50,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:29:50,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:29:50,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:29:50,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:29:50,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,258 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 34, 1]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 17 writes are split as follows [0, 16, 1]. [2024-11-17 00:29:50,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:29:50,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:29:50,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:29:50,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:29:50,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (1/1) ... [2024-11-17 00:29:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:29:50,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:50,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:29:50,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:29:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:29:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:29:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:29:50,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:29:50,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:29:50,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:29:50,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:29:50,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:29:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:29:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:29:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:29:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:29:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:29:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:29:50,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:29:50,527 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:29:50,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:29:50,984 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L555: call ULTIMATE.dealloc(main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset);havoc main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset; [2024-11-17 00:29:51,018 INFO L? ?]: Removed 184 outVars from TransFormulas that were not future-live. [2024-11-17 00:29:51,019 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:29:51,038 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:29:51,040 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:29:51,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:29:51 BoogieIcfgContainer [2024-11-17 00:29:51,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:29:51,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:29:51,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:29:51,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:29:51,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:29:49" (1/3) ... [2024-11-17 00:29:51,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fbe2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:29:51, skipping insertion in model container [2024-11-17 00:29:51,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:50" (2/3) ... [2024-11-17 00:29:51,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fbe2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:29:51, skipping insertion in model container [2024-11-17 00:29:51,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:29:51" (3/3) ... [2024-11-17 00:29:51,051 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2024-11-17 00:29:51,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:29:51,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-11-17 00:29:51,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:29:51,125 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;@5ba1dfd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:29:51,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2024-11-17 00:29:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 89 states have (on average 2.067415730337079) internal successors, (184), 166 states have internal predecessors, (184), 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-11-17 00:29:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:29:51,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:51,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:29:51,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 218427, now seen corresponding path program 1 times [2024-11-17 00:29:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378318468] [2024-11-17 00:29:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:51,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378318468] [2024-11-17 00:29:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378318468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:51,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:29:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026759903] [2024-11-17 00:29:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:29:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:29:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:29:51,470 INFO L87 Difference]: Start difference. First operand has 167 states, 89 states have (on average 2.067415730337079) internal successors, (184), 166 states have internal predecessors, (184), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:29:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:51,701 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2024-11-17 00:29:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:29:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 00:29:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:51,711 INFO L225 Difference]: With dead ends: 165 [2024-11-17 00:29:51,711 INFO L226 Difference]: Without dead ends: 162 [2024-11-17 00:29:51,713 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-11-17 00:29:51,716 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:51,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 150 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-17 00:29:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-17 00:29:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 87 states have (on average 2.0114942528735633) internal successors, (175), 161 states have internal predecessors, (175), 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-11-17 00:29:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2024-11-17 00:29:51,751 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 3 [2024-11-17 00:29:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:51,751 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2024-11-17 00:29:51,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:29:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2024-11-17 00:29:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:29:51,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:51,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:29:51,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:29:51,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:51,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash 218428, now seen corresponding path program 1 times [2024-11-17 00:29:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:51,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023767832] [2024-11-17 00:29:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023767832] [2024-11-17 00:29:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023767832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:51,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:29:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519179307] [2024-11-17 00:29:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:29:51,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:51,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:29:51,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:29:51,877 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:29:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:52,011 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2024-11-17 00:29:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:29:52,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 00:29:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:52,013 INFO L225 Difference]: With dead ends: 160 [2024-11-17 00:29:52,013 INFO L226 Difference]: Without dead ends: 160 [2024-11-17 00:29:52,013 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-11-17 00:29:52,015 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 108 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:52,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 154 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-17 00:29:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-17 00:29:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 159 states have internal predecessors, (173), 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-11-17 00:29:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2024-11-17 00:29:52,028 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 3 [2024-11-17 00:29:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:52,028 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2024-11-17 00:29:52,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:29:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2024-11-17 00:29:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:29:52,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:52,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:52,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:29:52,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:52,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 53128442, now seen corresponding path program 1 times [2024-11-17 00:29:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:52,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667885891] [2024-11-17 00:29:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:52,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:52,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667885891] [2024-11-17 00:29:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667885891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:29:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510551996] [2024-11-17 00:29:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:52,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:29:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:29:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:29:52,107 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:52,349 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2024-11-17 00:29:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:52,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:29:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:52,351 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:29:52,351 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:29:52,351 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-11-17 00:29:52,352 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 171 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:52,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 120 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:29:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-17 00:29:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 146 states have internal predecessors, (163), 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-11-17 00:29:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 163 transitions. [2024-11-17 00:29:52,365 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 163 transitions. Word has length 8 [2024-11-17 00:29:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:52,365 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 163 transitions. [2024-11-17 00:29:52,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 163 transitions. [2024-11-17 00:29:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:29:52,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:52,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:52,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:29:52,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:52,370 INFO L85 PathProgramCache]: Analyzing trace with hash 53128443, now seen corresponding path program 1 times [2024-11-17 00:29:52,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:52,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731191270] [2024-11-17 00:29:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:52,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:52,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731191270] [2024-11-17 00:29:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731191270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:52,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:29:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082140018] [2024-11-17 00:29:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:52,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:29:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:52,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:29:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:29:52,518 INFO L87 Difference]: Start difference. First operand 147 states and 163 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:52,865 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2024-11-17 00:29:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:29:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:29:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:52,868 INFO L225 Difference]: With dead ends: 192 [2024-11-17 00:29:52,868 INFO L226 Difference]: Without dead ends: 192 [2024-11-17 00:29:52,868 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-11-17 00:29:52,870 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 193 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:52,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 190 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:29:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-17 00:29:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2024-11-17 00:29:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 127 states have (on average 1.6456692913385826) internal successors, (209), 181 states have internal predecessors, (209), 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-11-17 00:29:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2024-11-17 00:29:52,886 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 8 [2024-11-17 00:29:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:52,886 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2024-11-17 00:29:52,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2024-11-17 00:29:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:29:52,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:52,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:52,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:29:52,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:52,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2070880100, now seen corresponding path program 1 times [2024-11-17 00:29:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395463028] [2024-11-17 00:29:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395463028] [2024-11-17 00:29:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395463028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:53,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549547505] [2024-11-17 00:29:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:53,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:53,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:53,007 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:53,131 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2024-11-17 00:29:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:53,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:29:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:53,133 INFO L225 Difference]: With dead ends: 183 [2024-11-17 00:29:53,134 INFO L226 Difference]: Without dead ends: 183 [2024-11-17 00:29:53,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-17 00:29:53,135 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 110 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:53,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 428 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-17 00:29:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-17 00:29:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 128 states have (on average 1.640625) internal successors, (210), 182 states have internal predecessors, (210), 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-11-17 00:29:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2024-11-17 00:29:53,143 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 11 [2024-11-17 00:29:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:53,143 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2024-11-17 00:29:53,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2024-11-17 00:29:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:29:53,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:53,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:53,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:29:53,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash -227225372, now seen corresponding path program 1 times [2024-11-17 00:29:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811780329] [2024-11-17 00:29:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811780329] [2024-11-17 00:29:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811780329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165214403] [2024-11-17 00:29:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:53,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:29:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:29:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:29:53,250 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:53,394 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2024-11-17 00:29:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:29:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 00:29:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:53,395 INFO L225 Difference]: With dead ends: 183 [2024-11-17 00:29:53,395 INFO L226 Difference]: Without dead ends: 183 [2024-11-17 00:29:53,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:53,396 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:53,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 215 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-17 00:29:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2024-11-17 00:29:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 127 states have (on average 1.6377952755905512) internal successors, (208), 181 states have internal predecessors, (208), 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-11-17 00:29:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2024-11-17 00:29:53,403 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 12 [2024-11-17 00:29:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:53,403 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2024-11-17 00:29:53,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2024-11-17 00:29:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:29:53,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:53,404 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:53,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:29:53,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 260975185, now seen corresponding path program 1 times [2024-11-17 00:29:53,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:53,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546261675] [2024-11-17 00:29:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:53,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:53,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:53,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546261675] [2024-11-17 00:29:53,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546261675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:53,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:53,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:29:53,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777426345] [2024-11-17 00:29:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:53,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:29:53,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:53,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:29:53,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:29:53,460 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:53,473 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2024-11-17 00:29:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:29:53,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 00:29:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:53,479 INFO L225 Difference]: With dead ends: 184 [2024-11-17 00:29:53,479 INFO L226 Difference]: Without dead ends: 184 [2024-11-17 00:29:53,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:29:53,480 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:53,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:29:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-17 00:29:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-17 00:29:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 129 states have (on average 1.627906976744186) internal successors, (210), 183 states have internal predecessors, (210), 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-11-17 00:29:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2024-11-17 00:29:53,486 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 16 [2024-11-17 00:29:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2024-11-17 00:29:53,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2024-11-17 00:29:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:29:53,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:53,488 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:53,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:29:53,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:53,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1261707569, now seen corresponding path program 1 times [2024-11-17 00:29:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179607703] [2024-11-17 00:29:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:53,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179607703] [2024-11-17 00:29:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179607703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:53,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:53,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:29:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700170691] [2024-11-17 00:29:53,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:53,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:53,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:53,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:53,751 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:53,944 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2024-11-17 00:29:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:29:53,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:29:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:53,945 INFO L225 Difference]: With dead ends: 218 [2024-11-17 00:29:53,945 INFO L226 Difference]: Without dead ends: 218 [2024-11-17 00:29:53,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:53,947 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 54 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:53,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 606 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-17 00:29:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2024-11-17 00:29:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 144 states have (on average 1.5972222222222223) internal successors, (230), 198 states have internal predecessors, (230), 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-11-17 00:29:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2024-11-17 00:29:53,954 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 18 [2024-11-17 00:29:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:53,955 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2024-11-17 00:29:53,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2024-11-17 00:29:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:29:53,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:53,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:29:53,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 71563940, now seen corresponding path program 1 times [2024-11-17 00:29:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754417336] [2024-11-17 00:29:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:54,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:54,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754417336] [2024-11-17 00:29:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754417336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:54,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187045770] [2024-11-17 00:29:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:54,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:54,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:54,113 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:54,294 INFO L93 Difference]: Finished difference Result 198 states and 228 transitions. [2024-11-17 00:29:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:54,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:29:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:54,295 INFO L225 Difference]: With dead ends: 198 [2024-11-17 00:29:54,295 INFO L226 Difference]: Without dead ends: 198 [2024-11-17 00:29:54,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:54,296 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:54,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 374 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-17 00:29:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-17 00:29:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.5833333333333333) internal successors, (228), 197 states have internal predecessors, (228), 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-11-17 00:29:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 228 transitions. [2024-11-17 00:29:54,315 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 228 transitions. Word has length 19 [2024-11-17 00:29:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:54,316 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 228 transitions. [2024-11-17 00:29:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 228 transitions. [2024-11-17 00:29:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:29:54,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:54,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:54,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:29:54,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash 71563941, now seen corresponding path program 1 times [2024-11-17 00:29:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002165719] [2024-11-17 00:29:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002165719] [2024-11-17 00:29:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002165719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:54,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:54,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773774173] [2024-11-17 00:29:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:54,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:54,549 INFO L87 Difference]: Start difference. First operand 198 states and 228 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:54,746 INFO L93 Difference]: Finished difference Result 197 states and 226 transitions. [2024-11-17 00:29:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:29:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:54,747 INFO L225 Difference]: With dead ends: 197 [2024-11-17 00:29:54,748 INFO L226 Difference]: Without dead ends: 197 [2024-11-17 00:29:54,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:54,748 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:54,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 361 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-17 00:29:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-17 00:29:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 144 states have (on average 1.5694444444444444) internal successors, (226), 196 states have internal predecessors, (226), 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-11-17 00:29:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 226 transitions. [2024-11-17 00:29:54,753 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 226 transitions. Word has length 19 [2024-11-17 00:29:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:54,754 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 226 transitions. [2024-11-17 00:29:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 226 transitions. [2024-11-17 00:29:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:29:54,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:54,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:29:54,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:54,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash -25406081, now seen corresponding path program 1 times [2024-11-17 00:29:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607067308] [2024-11-17 00:29:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607067308] [2024-11-17 00:29:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607067308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:54,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:54,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:29:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889142008] [2024-11-17 00:29:54,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:54,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:29:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:29:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:29:54,842 INFO L87 Difference]: Start difference. First operand 197 states and 226 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:55,017 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2024-11-17 00:29:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:55,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:29:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:55,018 INFO L225 Difference]: With dead ends: 215 [2024-11-17 00:29:55,018 INFO L226 Difference]: Without dead ends: 215 [2024-11-17 00:29:55,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:55,019 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 75 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:55,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 184 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-17 00:29:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 200. [2024-11-17 00:29:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 199 states have internal predecessors, (231), 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-11-17 00:29:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 231 transitions. [2024-11-17 00:29:55,023 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 231 transitions. Word has length 20 [2024-11-17 00:29:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:55,024 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 231 transitions. [2024-11-17 00:29:55,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2024-11-17 00:29:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:29:55,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:55,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:29:55,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:55,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -25406080, now seen corresponding path program 1 times [2024-11-17 00:29:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677772859] [2024-11-17 00:29:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:29:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677772859] [2024-11-17 00:29:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677772859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:29:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847924324] [2024-11-17 00:29:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:55,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:29:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:29:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:55,255 INFO L87 Difference]: Start difference. First operand 200 states and 231 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:55,574 INFO L93 Difference]: Finished difference Result 233 states and 266 transitions. [2024-11-17 00:29:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:29:55,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:29:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:55,576 INFO L225 Difference]: With dead ends: 233 [2024-11-17 00:29:55,577 INFO L226 Difference]: Without dead ends: 233 [2024-11-17 00:29:55,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:55,578 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 224 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:55,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 318 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:29:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-17 00:29:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2024-11-17 00:29:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 203 states have internal predecessors, (237), 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-11-17 00:29:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2024-11-17 00:29:55,583 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 20 [2024-11-17 00:29:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:55,584 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2024-11-17 00:29:55,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2024-11-17 00:29:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:29:55,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:55,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:55,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:29:55,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:55,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash -25376290, now seen corresponding path program 1 times [2024-11-17 00:29:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853408179] [2024-11-17 00:29:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:55,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853408179] [2024-11-17 00:29:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853408179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:29:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071376533] [2024-11-17 00:29:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:55,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:29:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:55,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:29:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:29:55,803 INFO L87 Difference]: Start difference. First operand 204 states and 237 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:56,045 INFO L93 Difference]: Finished difference Result 227 states and 261 transitions. [2024-11-17 00:29:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:29:56,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:29:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:56,047 INFO L225 Difference]: With dead ends: 227 [2024-11-17 00:29:56,047 INFO L226 Difference]: Without dead ends: 227 [2024-11-17 00:29:56,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:29:56,048 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 51 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:56,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 694 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-17 00:29:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2024-11-17 00:29:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 214 states have internal predecessors, (248), 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-11-17 00:29:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2024-11-17 00:29:56,055 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 20 [2024-11-17 00:29:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:56,055 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2024-11-17 00:29:56,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2024-11-17 00:29:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:29:56,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:56,057 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] [2024-11-17 00:29:56,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:29:56,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:56,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -787589926, now seen corresponding path program 1 times [2024-11-17 00:29:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:56,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623569346] [2024-11-17 00:29:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623569346] [2024-11-17 00:29:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623569346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:29:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253777892] [2024-11-17 00:29:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:56,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:29:56,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:29:56,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:29:56,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:29:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:56,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:29:56,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:29:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:29:56,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:29:56,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253777892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:56,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:29:56,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-17 00:29:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361275196] [2024-11-17 00:29:56,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:56,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:56,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:29:56,356 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:56,499 INFO L93 Difference]: Finished difference Result 229 states and 263 transitions. [2024-11-17 00:29:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:29:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:56,501 INFO L225 Difference]: With dead ends: 229 [2024-11-17 00:29:56,501 INFO L226 Difference]: Without dead ends: 229 [2024-11-17 00:29:56,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:29:56,502 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 133 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:56,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 408 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:29:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-17 00:29:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 213. [2024-11-17 00:29:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.53125) internal successors, (245), 212 states have internal predecessors, (245), 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-11-17 00:29:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 245 transitions. [2024-11-17 00:29:56,507 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 245 transitions. Word has length 21 [2024-11-17 00:29:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:56,507 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 245 transitions. [2024-11-17 00:29:56,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2024-11-17 00:29:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:29:56,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:56,508 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] [2024-11-17 00:29:56,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:29:56,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 00:29:56,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:56,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1657658912, now seen corresponding path program 1 times [2024-11-17 00:29:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448387999] [2024-11-17 00:29:56,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:56,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:56,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448387999] [2024-11-17 00:29:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448387999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:56,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:56,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:29:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011668349] [2024-11-17 00:29:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:56,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:29:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:56,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:29:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:56,966 INFO L87 Difference]: Start difference. First operand 213 states and 245 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:57,351 INFO L93 Difference]: Finished difference Result 218 states and 251 transitions. [2024-11-17 00:29:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:29:57,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:29:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:57,353 INFO L225 Difference]: With dead ends: 218 [2024-11-17 00:29:57,353 INFO L226 Difference]: Without dead ends: 218 [2024-11-17 00:29:57,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:29:57,354 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 63 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:57,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 356 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:29:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-17 00:29:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2024-11-17 00:29:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 160 states have (on average 1.51875) internal successors, (243), 211 states have internal predecessors, (243), 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-11-17 00:29:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 243 transitions. [2024-11-17 00:29:57,358 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 243 transitions. Word has length 22 [2024-11-17 00:29:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:57,359 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 243 transitions. [2024-11-17 00:29:57,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 243 transitions. [2024-11-17 00:29:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:29:57,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:57,360 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] [2024-11-17 00:29:57,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:29:57,360 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:57,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1657658911, now seen corresponding path program 1 times [2024-11-17 00:29:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805068280] [2024-11-17 00:29:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:57,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805068280] [2024-11-17 00:29:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805068280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:57,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:29:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069225433] [2024-11-17 00:29:57,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:57,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:29:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:29:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:57,549 INFO L87 Difference]: Start difference. First operand 212 states and 243 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:57,968 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2024-11-17 00:29:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:29:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:29:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:57,970 INFO L225 Difference]: With dead ends: 217 [2024-11-17 00:29:57,970 INFO L226 Difference]: Without dead ends: 217 [2024-11-17 00:29:57,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:29:57,971 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 61 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:57,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 410 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:29:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-17 00:29:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2024-11-17 00:29:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 160 states have (on average 1.50625) internal successors, (241), 210 states have internal predecessors, (241), 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-11-17 00:29:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 241 transitions. [2024-11-17 00:29:57,978 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 241 transitions. Word has length 22 [2024-11-17 00:29:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 241 transitions. [2024-11-17 00:29:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 241 transitions. [2024-11-17 00:29:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:29:57,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:57,980 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] [2024-11-17 00:29:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:29:57,981 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:57,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1732295554, now seen corresponding path program 1 times [2024-11-17 00:29:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087181902] [2024-11-17 00:29:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087181902] [2024-11-17 00:29:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087181902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:58,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:58,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785349553] [2024-11-17 00:29:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:58,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:58,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:58,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:58,067 INFO L87 Difference]: Start difference. First operand 211 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:58,251 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2024-11-17 00:29:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:58,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:29:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:58,252 INFO L225 Difference]: With dead ends: 210 [2024-11-17 00:29:58,252 INFO L226 Difference]: Without dead ends: 210 [2024-11-17 00:29:58,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:58,253 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:58,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 364 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-17 00:29:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-17 00:29:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.49375) internal successors, (239), 209 states have internal predecessors, (239), 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-11-17 00:29:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 239 transitions. [2024-11-17 00:29:58,258 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 239 transitions. Word has length 23 [2024-11-17 00:29:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:58,258 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 239 transitions. [2024-11-17 00:29:58,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 239 transitions. [2024-11-17 00:29:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:29:58,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:58,259 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] [2024-11-17 00:29:58,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:29:58,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:58,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1732295555, now seen corresponding path program 1 times [2024-11-17 00:29:58,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:58,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890802206] [2024-11-17 00:29:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:58,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890802206] [2024-11-17 00:29:58,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890802206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:58,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:58,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:29:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437551471] [2024-11-17 00:29:58,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:58,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:29:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:29:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:29:58,399 INFO L87 Difference]: Start difference. First operand 210 states and 239 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:58,606 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2024-11-17 00:29:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:29:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:29:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:58,607 INFO L225 Difference]: With dead ends: 209 [2024-11-17 00:29:58,607 INFO L226 Difference]: Without dead ends: 209 [2024-11-17 00:29:58,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:29:58,608 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:58,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:29:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-17 00:29:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-17 00:29:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.48125) internal successors, (237), 208 states have internal predecessors, (237), 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-11-17 00:29:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 237 transitions. [2024-11-17 00:29:58,612 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 237 transitions. Word has length 23 [2024-11-17 00:29:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:58,612 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 237 transitions. [2024-11-17 00:29:58,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2024-11-17 00:29:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:29:58,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:58,613 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-11-17 00:29:58,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:29:58,613 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:58,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1510104153, now seen corresponding path program 1 times [2024-11-17 00:29:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185922288] [2024-11-17 00:29:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:58,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185922288] [2024-11-17 00:29:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185922288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:58,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:58,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:29:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392519410] [2024-11-17 00:29:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:58,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:29:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:29:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:58,800 INFO L87 Difference]: Start difference. First operand 209 states and 237 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:59,205 INFO L93 Difference]: Finished difference Result 214 states and 244 transitions. [2024-11-17 00:29:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:29:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:29:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:59,207 INFO L225 Difference]: With dead ends: 214 [2024-11-17 00:29:59,207 INFO L226 Difference]: Without dead ends: 214 [2024-11-17 00:29:59,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:29:59,208 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:59,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 395 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:29:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-17 00:29:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2024-11-17 00:29:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.475) internal successors, (236), 207 states have internal predecessors, (236), 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-11-17 00:29:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2024-11-17 00:29:59,212 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 26 [2024-11-17 00:29:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:59,212 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2024-11-17 00:29:59,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2024-11-17 00:29:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:29:59,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:59,213 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-11-17 00:29:59,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:29:59,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:59,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1510104152, now seen corresponding path program 1 times [2024-11-17 00:29:59,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617425917] [2024-11-17 00:29:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:29:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:29:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:29:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617425917] [2024-11-17 00:29:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617425917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:29:59,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:29:59,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:29:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967757556] [2024-11-17 00:29:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:29:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:29:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:29:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:29:59,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:29:59,484 INFO L87 Difference]: Start difference. First operand 208 states and 236 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:29:59,804 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2024-11-17 00:29:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:29:59,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:29:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:29:59,805 INFO L225 Difference]: With dead ends: 213 [2024-11-17 00:29:59,805 INFO L226 Difference]: Without dead ends: 213 [2024-11-17 00:29:59,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:29:59,807 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:29:59,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 294 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:29:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-17 00:29:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2024-11-17 00:29:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.46875) internal successors, (235), 206 states have internal predecessors, (235), 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-11-17 00:29:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2024-11-17 00:29:59,815 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 26 [2024-11-17 00:29:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:29:59,815 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2024-11-17 00:29:59,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:29:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2024-11-17 00:29:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 00:29:59,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:29:59,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:29:59,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:29:59,818 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:29:59,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:29:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1510168872, now seen corresponding path program 1 times [2024-11-17 00:29:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:29:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934081918] [2024-11-17 00:29:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:29:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:29:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:00,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934081918] [2024-11-17 00:30:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934081918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043957592] [2024-11-17 00:30:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:00,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:00,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:00,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:30:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:00,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-17 00:30:00,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:00,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:30:00,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:30:00,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 00:30:00,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 00:30:00,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:00,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2024-11-17 00:30:00,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-17 00:30:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:00,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:01,246 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 14 treesize of output 12 [2024-11-17 00:30:01,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-17 00:30:01,264 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 14 treesize of output 12 [2024-11-17 00:30:01,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:30:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043957592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:30:01,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:30:01,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 27 [2024-11-17 00:30:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926813576] [2024-11-17 00:30:01,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:01,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-17 00:30:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-17 00:30:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:30:01,300 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 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-11-17 00:30:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:02,285 INFO L93 Difference]: Finished difference Result 307 states and 355 transitions. [2024-11-17 00:30:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:30:02,286 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 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 30 [2024-11-17 00:30:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:02,287 INFO L225 Difference]: With dead ends: 307 [2024-11-17 00:30:02,287 INFO L226 Difference]: Without dead ends: 307 [2024-11-17 00:30:02,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=1219, Unknown=0, NotChecked=0, Total=1406 [2024-11-17 00:30:02,289 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 399 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:02,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 2054 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:30:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-17 00:30:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 278. [2024-11-17 00:30:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 231 states have (on average 1.4242424242424243) internal successors, (329), 277 states have internal predecessors, (329), 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-11-17 00:30:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 329 transitions. [2024-11-17 00:30:02,295 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 329 transitions. Word has length 30 [2024-11-17 00:30:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:02,295 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 329 transitions. [2024-11-17 00:30:02,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 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-11-17 00:30:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 329 transitions. [2024-11-17 00:30:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:30:02,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:02,296 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:02,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:30:02,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-17 00:30:02,501 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:30:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1342100466, now seen corresponding path program 2 times [2024-11-17 00:30:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:02,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469175595] [2024-11-17 00:30:02,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:03,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469175595] [2024-11-17 00:30:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469175595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129012332] [2024-11-17 00:30:03,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:30:03,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:03,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:03,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:03,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:30:04,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:30:04,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:30:04,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-17 00:30:04,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:04,058 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-11-17 00:30:04,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:30:04,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-17 00:30:04,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:04,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-17 00:30:04,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:30:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:04,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129012332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:30:04,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:30:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 10] total 36 [2024-11-17 00:30:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644188357] [2024-11-17 00:30:04,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-17 00:30:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:04,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-17 00:30:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 00:30:04,690 INFO L87 Difference]: Start difference. First operand 278 states and 329 transitions. Second operand has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 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-11-17 00:30:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:07,945 INFO L93 Difference]: Finished difference Result 425 states and 497 transitions. [2024-11-17 00:30:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-17 00:30:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 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 40 [2024-11-17 00:30:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:07,948 INFO L225 Difference]: With dead ends: 425 [2024-11-17 00:30:07,948 INFO L226 Difference]: Without dead ends: 425 [2024-11-17 00:30:07,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=665, Invalid=6475, Unknown=0, NotChecked=0, Total=7140 [2024-11-17 00:30:07,950 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 511 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:07,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2064 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3694 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 00:30:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-17 00:30:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 340. [2024-11-17 00:30:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 293 states have (on average 1.3856655290102389) internal successors, (406), 339 states have internal predecessors, (406), 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-11-17 00:30:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 406 transitions. [2024-11-17 00:30:07,957 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 406 transitions. Word has length 40 [2024-11-17 00:30:07,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:07,957 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 406 transitions. [2024-11-17 00:30:07,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 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-11-17 00:30:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 406 transitions. [2024-11-17 00:30:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:30:07,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:07,958 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:07,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:30:08,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:08,159 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:30:08,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1344559929, now seen corresponding path program 1 times [2024-11-17 00:30:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:08,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576818046] [2024-11-17 00:30:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:08,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 00:30:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576818046] [2024-11-17 00:30:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576818046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026391108] [2024-11-17 00:30:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:08,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:08,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:08,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:30:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:08,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:30:08,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 00:30:08,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 00:30:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026391108] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:30:08,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:30:08,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-17 00:30:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137707975] [2024-11-17 00:30:08,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:08,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:30:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:08,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:30:08,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:30:08,637 INFO L87 Difference]: Start difference. First operand 340 states and 406 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:08,749 INFO L93 Difference]: Finished difference Result 366 states and 438 transitions. [2024-11-17 00:30:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:30:08,749 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), 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 41 [2024-11-17 00:30:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:08,751 INFO L225 Difference]: With dead ends: 366 [2024-11-17 00:30:08,751 INFO L226 Difference]: Without dead ends: 366 [2024-11-17 00:30:08,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:30:08,751 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 49 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:08,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 340 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-17 00:30:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 345. [2024-11-17 00:30:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 298 states have (on average 1.3859060402684564) internal successors, (413), 344 states have internal predecessors, (413), 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-11-17 00:30:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 413 transitions. [2024-11-17 00:30:08,757 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 413 transitions. Word has length 41 [2024-11-17 00:30:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:08,757 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 413 transitions. [2024-11-17 00:30:08,758 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), 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-11-17 00:30:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 413 transitions. [2024-11-17 00:30:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-17 00:30:08,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:08,758 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:08,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:30:08,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:08,963 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 74 more)] === [2024-11-17 00:30:08,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 985042319, now seen corresponding path program 1 times [2024-11-17 00:30:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441363410] [2024-11-17 00:30:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441363410] [2024-11-17 00:30:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441363410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586587794] [2024-11-17 00:30:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:09,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:09,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:30:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:09,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-17 00:30:09,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:09,671 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:30:09,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:30:09,709 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-11-17 00:30:09,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 00:30:09,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 00:30:09,855 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 00:30:09,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 00:30:09,959 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 31 treesize of output 13 [2024-11-17 00:30:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:10,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:10,168 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_808))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_809)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-17 00:30:10,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:10,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2024-11-17 00:30:10,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:10,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 251 [2024-11-17 00:30:10,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:10,263 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 191 treesize of output 175 [2024-11-17 00:30:10,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 151 [2024-11-17 00:30:18,677 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 1459 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-17 00:30:18,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:18,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 27 select indices, 27 select index equivalence classes, 0 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 351 case distinctions, treesize of input 402 treesize of output 3144