./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:52:35,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:52:36,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:52:36,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:52:36,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:52:36,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:52:36,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:52:36,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:52:36,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:52:36,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:52:36,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:52:36,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:52:36,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:52:36,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:52:36,087 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:52:36,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:52:36,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:52:36,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:52:36,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:52:36,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:52:36,089 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:52:36,097 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:52:36,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:52:36,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:52:36,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:52:36,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:52:36,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:52:36,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:52:36,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:52:36,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:52:36,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:52:36,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:52:36,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:52:36,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:52:36,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:52:36,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:52:36,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:52:36,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:52:36,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:52:36,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:52:36,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:52:36,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:52:36,102 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2024-11-20 14:52:36,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:52:36,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:52:36,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:52:36,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:52:36,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:52:36,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2024-11-20 14:52:37,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:52:38,149 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:52:38,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2024-11-20 14:52:38,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c145186/3052eadd15e8424d96b95cbd1717a912/FLAG31143d2d1 [2024-11-20 14:52:38,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c145186/3052eadd15e8424d96b95cbd1717a912 [2024-11-20 14:52:38,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:52:38,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:52:38,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:52:38,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:52:38,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:52:38,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:52:38" (1/1) ... [2024-11-20 14:52:38,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:38, skipping insertion in model container [2024-11-20 14:52:38,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:52:38" (1/1) ... [2024-11-20 14:52:38,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:52:38,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:52:38,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:52:38,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:52:39,027 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:52:39,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39 WrapperNode [2024-11-20 14:52:39,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:52:39,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:52:39,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:52:39,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:52:39,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,091 INFO L138 Inliner]: procedures = 119, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 233 [2024-11-20 14:52:39,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:52:39,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:52:39,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:52:39,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:52:39,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,140 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-20 14:52:39,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:52:39,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:52:39,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:52:39,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:52:39,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (1/1) ... [2024-11-20 14:52:39,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:52:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:39,223 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-20 14:52:39,226 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-20 14:52:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 14:52:39,279 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 14:52:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:52:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:52:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:52:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:52:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:52:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:52:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:52:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:52:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:52:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:52:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:52:39,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:52:39,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:52:40,079 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-20 14:52:40,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:52:40,103 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:52:40,105 INFO L316 CfgBuilder]: Removed 30 assume(true) statements. [2024-11-20 14:52:40,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:52:40 BoogieIcfgContainer [2024-11-20 14:52:40,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:52:40,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:52:40,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:52:40,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:52:40,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:52:38" (1/3) ... [2024-11-20 14:52:40,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a361664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:52:40, skipping insertion in model container [2024-11-20 14:52:40,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:52:39" (2/3) ... [2024-11-20 14:52:40,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a361664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:52:40, skipping insertion in model container [2024-11-20 14:52:40,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:52:40" (3/3) ... [2024-11-20 14:52:40,117 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2024-11-20 14:52:40,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:52:40,135 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2024-11-20 14:52:40,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:52:40,204 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;@37cfbced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:52:40,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-11-20 14:52:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 117 states have (on average 2.051282051282051) internal successors, (240), 185 states have internal predecessors, (240), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-20 14:52:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 14:52:40,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:40,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 14:52:40,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:40,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:40,224 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-20 14:52:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313748258] [2024-11-20 14:52:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:40,450 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-20 14:52:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313748258] [2024-11-20 14:52:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313748258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:40,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:40,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:52:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234676353] [2024-11-20 14:52:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:40,495 INFO L87 Difference]: Start difference. First operand has 200 states, 117 states have (on average 2.051282051282051) internal successors, (240), 185 states have internal predecessors, (240), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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-20 14:52:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:40,724 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2024-11-20 14:52:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:40,727 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-20 14:52:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:40,735 INFO L225 Difference]: With dead ends: 180 [2024-11-20 14:52:40,735 INFO L226 Difference]: Without dead ends: 178 [2024-11-20 14:52:40,736 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-20 14:52:40,740 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 160 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:40,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 129 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-20 14:52:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-20 14:52:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 105 states have (on average 1.8095238095238095) internal successors, (190), 176 states have internal predecessors, (190), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-20 14:52:40,792 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 3 [2024-11-20 14:52:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:40,793 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-20 14:52:40,793 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-20 14:52:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-20 14:52:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 14:52:40,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:40,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 14:52:40,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:52:40,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:40,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-20 14:52:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413841348] [2024-11-20 14:52:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:40,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:40,933 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-20 14:52:40,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:40,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413841348] [2024-11-20 14:52:40,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413841348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:40,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:52:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489300431] [2024-11-20 14:52:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:40,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:40,938 INFO L87 Difference]: Start difference. First operand 178 states and 203 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-20 14:52:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:41,117 INFO L93 Difference]: Finished difference Result 198 states and 227 transitions. [2024-11-20 14:52:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:41,119 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-20 14:52:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:41,120 INFO L225 Difference]: With dead ends: 198 [2024-11-20 14:52:41,123 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 14:52:41,124 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-20 14:52:41,125 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 158 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:41,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 153 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 14:52:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2024-11-20 14:52:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 122 states have (on average 1.7295081967213115) internal successors, (211), 186 states have internal predecessors, (211), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2024-11-20 14:52:41,141 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 3 [2024-11-20 14:52:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:41,142 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2024-11-20 14:52:41,142 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-20 14:52:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2024-11-20 14:52:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:52:41,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:41,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:41,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:52:41,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:41,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1467444989, now seen corresponding path program 1 times [2024-11-20 14:52:41,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:41,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857736563] [2024-11-20 14:52:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:41,239 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-20 14:52:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857736563] [2024-11-20 14:52:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857736563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:41,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:41,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487367566] [2024-11-20 14:52:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:41,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:41,244 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:41,334 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2024-11-20 14:52:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:41,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 14:52:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:41,338 INFO L225 Difference]: With dead ends: 199 [2024-11-20 14:52:41,339 INFO L226 Difference]: Without dead ends: 199 [2024-11-20 14:52:41,340 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-20 14:52:41,341 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 161 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:41,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 215 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-20 14:52:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2024-11-20 14:52:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 122 states have (on average 1.7131147540983607) internal successors, (209), 185 states have internal predecessors, (209), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 221 transitions. [2024-11-20 14:52:41,358 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 221 transitions. Word has length 7 [2024-11-20 14:52:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:41,362 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 221 transitions. [2024-11-20 14:52:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 221 transitions. [2024-11-20 14:52:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 14:52:41,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:41,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:41,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:52:41,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:41,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1997087996, now seen corresponding path program 1 times [2024-11-20 14:52:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152194654] [2024-11-20 14:52:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:41,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:41,579 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-20 14:52:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152194654] [2024-11-20 14:52:41,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152194654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:41,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106374305] [2024-11-20 14:52:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:41,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:41,583 INFO L87 Difference]: Start difference. First operand 187 states and 221 transitions. Second operand has 5 states, 4 states have (on average 2.75) 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-20 14:52:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:41,768 INFO L93 Difference]: Finished difference Result 186 states and 220 transitions. [2024-11-20 14:52:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:41,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) 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-20 14:52:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:41,770 INFO L225 Difference]: With dead ends: 186 [2024-11-20 14:52:41,770 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 14:52:41,771 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-20 14:52:41,772 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:41,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 544 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 14:52:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-20 14:52:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 122 states have (on average 1.7049180327868851) internal successors, (208), 184 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2024-11-20 14:52:41,780 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 11 [2024-11-20 14:52:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2024-11-20 14:52:41,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) 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-20 14:52:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2024-11-20 14:52:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 14:52:41,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:41,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:41,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:52:41,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:41,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:41,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1997087997, now seen corresponding path program 1 times [2024-11-20 14:52:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:41,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933673852] [2024-11-20 14:52:41,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:41,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:42,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:42,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933673852] [2024-11-20 14:52:42,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933673852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:42,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:42,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:42,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547804137] [2024-11-20 14:52:42,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:42,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:42,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:42,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:42,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:42,009 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 5 states, 4 states have (on average 2.75) 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-20 14:52:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:42,226 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2024-11-20 14:52:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) 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-20 14:52:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:42,228 INFO L225 Difference]: With dead ends: 185 [2024-11-20 14:52:42,228 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 14:52:42,228 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-20 14:52:42,230 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:42,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 555 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 14:52:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-20 14:52:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 122 states have (on average 1.6967213114754098) internal successors, (207), 183 states have internal predecessors, (207), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2024-11-20 14:52:42,244 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 11 [2024-11-20 14:52:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:42,248 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2024-11-20 14:52:42,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) 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-20 14:52:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2024-11-20 14:52:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 14:52:42,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:42,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:42,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:52:42,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:42,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1031688568, now seen corresponding path program 1 times [2024-11-20 14:52:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425340872] [2024-11-20 14:52:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:42,287 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-20 14:52:42,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425340872] [2024-11-20 14:52:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425340872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:42,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:42,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:42,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693524954] [2024-11-20 14:52:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:42,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:42,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:42,291 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:42,303 INFO L93 Difference]: Finished difference Result 186 states and 220 transitions. [2024-11-20 14:52:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:42,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-20 14:52:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:42,305 INFO L225 Difference]: With dead ends: 186 [2024-11-20 14:52:42,305 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 14:52:42,306 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-20 14:52:42,307 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 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-20 14:52:42,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:52:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 14:52:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-20 14:52:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 123 states have (on average 1.6910569105691058) internal successors, (208), 184 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2024-11-20 14:52:42,319 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 15 [2024-11-20 14:52:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:42,319 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2024-11-20 14:52:42,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2024-11-20 14:52:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:52:42,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:42,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:42,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:52:42,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:42,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1361526525, now seen corresponding path program 1 times [2024-11-20 14:52:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577558622] [2024-11-20 14:52:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:42,534 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-20 14:52:42,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577558622] [2024-11-20 14:52:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577558622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:42,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:42,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:52:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933169776] [2024-11-20 14:52:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:52:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:52:42,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:42,537 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:42,894 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2024-11-20 14:52:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:52:42,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 14:52:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:42,898 INFO L225 Difference]: With dead ends: 185 [2024-11-20 14:52:42,898 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 14:52:42,898 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-20 14:52:42,899 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 158 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:42,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 530 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 14:52:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-20 14:52:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 123 states have (on average 1.6829268292682926) internal successors, (207), 183 states have internal predecessors, (207), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2024-11-20 14:52:42,903 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 14 [2024-11-20 14:52:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:42,904 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2024-11-20 14:52:42,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2024-11-20 14:52:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:52:42,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:42,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:42,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:52:42,905 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:42,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:42,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1361526526, now seen corresponding path program 1 times [2024-11-20 14:52:42,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:42,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718124059] [2024-11-20 14:52:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:43,195 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-20 14:52:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718124059] [2024-11-20 14:52:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718124059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:43,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:43,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:52:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108547595] [2024-11-20 14:52:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:43,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:52:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:43,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:52:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:43,198 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:43,545 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2024-11-20 14:52:43,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:52:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 14:52:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:43,547 INFO L225 Difference]: With dead ends: 184 [2024-11-20 14:52:43,547 INFO L226 Difference]: Without dead ends: 184 [2024-11-20 14:52:43,547 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-20 14:52:43,548 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 155 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:43,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 414 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-20 14:52:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-20 14:52:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 182 states have internal predecessors, (206), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2024-11-20 14:52:43,554 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 14 [2024-11-20 14:52:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2024-11-20 14:52:43,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2024-11-20 14:52:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:52:43,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:43,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:43,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:52:43,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1909218637, now seen corresponding path program 1 times [2024-11-20 14:52:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372756314] [2024-11-20 14:52:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:43,694 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-20 14:52:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372756314] [2024-11-20 14:52:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372756314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:43,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:43,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:52:43,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79658890] [2024-11-20 14:52:43,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:43,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:52:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:52:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:52:43,700 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:43,922 INFO L93 Difference]: Finished difference Result 265 states and 314 transitions. [2024-11-20 14:52:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:52:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 14:52:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:43,924 INFO L225 Difference]: With dead ends: 265 [2024-11-20 14:52:43,924 INFO L226 Difference]: Without dead ends: 265 [2024-11-20 14:52:43,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:52:43,925 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 88 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:43,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 764 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-20 14:52:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 182. [2024-11-20 14:52:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 122 states have (on average 1.6721311475409837) internal successors, (204), 180 states have internal predecessors, (204), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2024-11-20 14:52:43,930 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 17 [2024-11-20 14:52:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:43,930 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2024-11-20 14:52:43,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2024-11-20 14:52:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:52:43,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:43,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:43,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:52:43,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:43,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash 460258648, now seen corresponding path program 1 times [2024-11-20 14:52:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:43,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239568519] [2024-11-20 14:52:43,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239568519] [2024-11-20 14:52:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239568519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:44,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:52:44,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042518401] [2024-11-20 14:52:44,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:44,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:44,043 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:44,170 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2024-11-20 14:52:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:44,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 14:52:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:44,172 INFO L225 Difference]: With dead ends: 266 [2024-11-20 14:52:44,172 INFO L226 Difference]: Without dead ends: 266 [2024-11-20 14:52:44,172 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-20 14:52:44,172 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 87 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:44,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 609 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-20 14:52:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2024-11-20 14:52:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 125 states have (on average 1.656) internal successors, (207), 183 states have internal predecessors, (207), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 218 transitions. [2024-11-20 14:52:44,177 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 218 transitions. Word has length 17 [2024-11-20 14:52:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:44,177 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 218 transitions. [2024-11-20 14:52:44,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2024-11-20 14:52:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:52:44,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:44,178 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-20 14:52:44,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:52:44,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:44,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 583601885, now seen corresponding path program 1 times [2024-11-20 14:52:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491466000] [2024-11-20 14:52:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:44,261 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-20 14:52:44,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491466000] [2024-11-20 14:52:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491466000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241374514] [2024-11-20 14:52:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:52:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:44,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:52:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:52:44,263 INFO L87 Difference]: Start difference. First operand 185 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-20 14:52:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:44,418 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2024-11-20 14:52:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:52:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-20 14:52:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:44,419 INFO L225 Difference]: With dead ends: 176 [2024-11-20 14:52:44,419 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 14:52:44,420 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-20 14:52:44,420 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 215 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:44,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 122 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 14:52:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-20 14:52:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 127 states have (on average 1.5590551181102361) internal successors, (198), 174 states have internal predecessors, (198), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2024-11-20 14:52:44,424 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 209 transitions. Word has length 19 [2024-11-20 14:52:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:44,424 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 209 transitions. [2024-11-20 14:52:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-20 14:52:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 209 transitions. [2024-11-20 14:52:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:52:44,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:44,425 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-20 14:52:44,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:52:44,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:44,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 583601886, now seen corresponding path program 1 times [2024-11-20 14:52:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826087449] [2024-11-20 14:52:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:44,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-20 14:52:44,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826087449] [2024-11-20 14:52:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826087449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069926086] [2024-11-20 14:52:44,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:44,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:52:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:52:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:52:44,518 INFO L87 Difference]: Start difference. First operand 176 states and 209 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-20 14:52:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:44,708 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2024-11-20 14:52:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:52:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-20 14:52:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:44,709 INFO L225 Difference]: With dead ends: 221 [2024-11-20 14:52:44,709 INFO L226 Difference]: Without dead ends: 221 [2024-11-20 14:52:44,710 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-20 14:52:44,710 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 212 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:44,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 204 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-20 14:52:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2024-11-20 14:52:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 198 states have internal predecessors, (237), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2024-11-20 14:52:44,715 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 19 [2024-11-20 14:52:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:44,715 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2024-11-20 14:52:44,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-20 14:52:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2024-11-20 14:52:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 14:52:44,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:44,716 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-20 14:52:44,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:52:44,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:44,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1788866723, now seen corresponding path program 1 times [2024-11-20 14:52:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:44,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347508070] [2024-11-20 14:52:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:44,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347508070] [2024-11-20 14:52:44,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347508070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:44,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:44,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875840602] [2024-11-20 14:52:44,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:44,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:52:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:44,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:52:44,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:52:44,758 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:44,857 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2024-11-20 14:52:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:52:44,858 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-20 14:52:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:44,859 INFO L225 Difference]: With dead ends: 222 [2024-11-20 14:52:44,859 INFO L226 Difference]: Without dead ends: 222 [2024-11-20 14:52:44,859 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-20 14:52:44,860 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 212 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:44,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 289 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-20 14:52:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2024-11-20 14:52:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 197 states have internal predecessors, (235), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2024-11-20 14:52:44,864 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 23 [2024-11-20 14:52:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:44,864 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2024-11-20 14:52:44,865 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2024-11-20 14:52:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 14:52:44,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:44,867 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-20 14:52:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:52:44,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1742737311, now seen corresponding path program 1 times [2024-11-20 14:52:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962603792] [2024-11-20 14:52:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:44,994 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-20 14:52:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962603792] [2024-11-20 14:52:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962603792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:52:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836009662] [2024-11-20 14:52:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:52:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:52:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:52:44,997 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-20 14:52:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:45,212 INFO L93 Difference]: Finished difference Result 199 states and 245 transitions. [2024-11-20 14:52:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:52:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-20 14:52:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:45,214 INFO L225 Difference]: With dead ends: 199 [2024-11-20 14:52:45,214 INFO L226 Difference]: Without dead ends: 199 [2024-11-20 14:52:45,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:45,215 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 78 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:45,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 426 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-20 14:52:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2024-11-20 14:52:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 151 states have (on average 1.5496688741721854) internal successors, (234), 196 states have internal predecessors, (234), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2024-11-20 14:52:45,219 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 23 [2024-11-20 14:52:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:45,219 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2024-11-20 14:52:45,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-20 14:52:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2024-11-20 14:52:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 14:52:45,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:45,220 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-20 14:52:45,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:52:45,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:45,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1742737312, now seen corresponding path program 1 times [2024-11-20 14:52:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311118324] [2024-11-20 14:52:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:45,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:45,362 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-20 14:52:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311118324] [2024-11-20 14:52:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311118324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:45,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:45,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:52:45,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631624115] [2024-11-20 14:52:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:45,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:52:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:52:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:52:45,365 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-20 14:52:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:45,595 INFO L93 Difference]: Finished difference Result 190 states and 236 transitions. [2024-11-20 14:52:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:52:45,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-20 14:52:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:45,598 INFO L225 Difference]: With dead ends: 190 [2024-11-20 14:52:45,598 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 14:52:45,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:45,599 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 35 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:45,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 511 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 14:52:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2024-11-20 14:52:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.5) internal successors, (219), 182 states have internal predecessors, (219), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 229 transitions. [2024-11-20 14:52:45,605 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 229 transitions. Word has length 23 [2024-11-20 14:52:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:45,606 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 229 transitions. [2024-11-20 14:52:45,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-20 14:52:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 229 transitions. [2024-11-20 14:52:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:52:45,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:45,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:52:45,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1412424787, now seen corresponding path program 1 times [2024-11-20 14:52:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300436339] [2024-11-20 14:52:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:45,707 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-20 14:52:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300436339] [2024-11-20 14:52:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300436339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:52:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530425182] [2024-11-20 14:52:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:45,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:52:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:52:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:52:45,708 INFO L87 Difference]: Start difference. First operand 184 states and 229 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:45,822 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2024-11-20 14:52:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:52:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 14:52:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:45,823 INFO L225 Difference]: With dead ends: 188 [2024-11-20 14:52:45,823 INFO L226 Difference]: Without dead ends: 188 [2024-11-20 14:52:45,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:45,824 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 34 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:45,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 632 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-20 14:52:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2024-11-20 14:52:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 180 states have internal predecessors, (217), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 225 transitions. [2024-11-20 14:52:45,828 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 225 transitions. Word has length 27 [2024-11-20 14:52:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:45,828 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 225 transitions. [2024-11-20 14:52:45,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2024-11-20 14:52:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:52:45,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:45,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:45,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:52:45,829 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1770327585, now seen corresponding path program 1 times [2024-11-20 14:52:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361334101] [2024-11-20 14:52:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:45,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-20 14:52:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361334101] [2024-11-20 14:52:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361334101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:45,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:45,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:45,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017641364] [2024-11-20 14:52:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:45,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:45,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:45,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:45,873 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:45,886 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2024-11-20 14:52:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-20 14:52:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:45,888 INFO L225 Difference]: With dead ends: 194 [2024-11-20 14:52:45,888 INFO L226 Difference]: Without dead ends: 194 [2024-11-20 14:52:45,888 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-20 14:52:45,889 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 7 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:45,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 295 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:52:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-20 14:52:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2024-11-20 14:52:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 233 transitions. [2024-11-20 14:52:45,892 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 233 transitions. Word has length 29 [2024-11-20 14:52:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:45,893 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 233 transitions. [2024-11-20 14:52:45,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 233 transitions. [2024-11-20 14:52:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:52:45,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:45,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:45,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:52:45,894 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:45,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash -978760908, now seen corresponding path program 1 times [2024-11-20 14:52:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407959440] [2024-11-20 14:52:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:45,922 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-20 14:52:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:45,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407959440] [2024-11-20 14:52:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407959440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:45,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341427050] [2024-11-20 14:52:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:45,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:45,925 INFO L87 Difference]: Start difference. First operand 188 states and 233 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:45,948 INFO L93 Difference]: Finished difference Result 187 states and 230 transitions. [2024-11-20 14:52:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:45,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-20 14:52:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:45,950 INFO L225 Difference]: With dead ends: 187 [2024-11-20 14:52:45,950 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 14:52:45,950 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-20 14:52:45,951 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 11 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:45,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 267 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:52:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 14:52:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-20 14:52:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 230 transitions. [2024-11-20 14:52:45,954 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 230 transitions. Word has length 30 [2024-11-20 14:52:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:45,954 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 230 transitions. [2024-11-20 14:52:45,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 230 transitions. [2024-11-20 14:52:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:52:45,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:45,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:45,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:52:45,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:45,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1769540364, now seen corresponding path program 1 times [2024-11-20 14:52:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587819337] [2024-11-20 14:52:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:46,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-20 14:52:46,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:46,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587819337] [2024-11-20 14:52:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587819337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:52:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377603934] [2024-11-20 14:52:46,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:46,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:52:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:52:46,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:52:46,109 INFO L87 Difference]: Start difference. First operand 187 states and 230 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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-20 14:52:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:46,432 INFO L93 Difference]: Finished difference Result 283 states and 343 transitions. [2024-11-20 14:52:46,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:52:46,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-20 14:52:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:46,433 INFO L225 Difference]: With dead ends: 283 [2024-11-20 14:52:46,434 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 14:52:46,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:52:46,434 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 179 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:46,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 777 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 14:52:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 199. [2024-11-20 14:52:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 164 states have (on average 1.4390243902439024) internal successors, (236), 197 states have internal predecessors, (236), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 243 transitions. [2024-11-20 14:52:46,439 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 243 transitions. Word has length 29 [2024-11-20 14:52:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:46,439 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 243 transitions. [2024-11-20 14:52:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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-20 14:52:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 243 transitions. [2024-11-20 14:52:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:52:46,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:46,440 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:46,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:52:46,440 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 482807040, now seen corresponding path program 1 times [2024-11-20 14:52:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:46,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60961056] [2024-11-20 14:52:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:46,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:46,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60961056] [2024-11-20 14:52:46,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60961056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:52:46,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715089459] [2024-11-20 14:52:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:46,618 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-20 14:52:46,621 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-20 14:52:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:46,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 14:52:46,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:52:46,784 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-20 14:52:46,790 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-20 14:52:46,853 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-20 14:52:46,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 14:52:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:47,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:52:47,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-20 14:52:47,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-20 14:52:47,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-20 14:52:47,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:52:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:47,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715089459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:52:47,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:52:47,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-20 14:52:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319594162] [2024-11-20 14:52:47,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:52:47,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:52:47,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:47,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:52:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:52:47,714 INFO L87 Difference]: Start difference. First operand 199 states and 243 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 14:52:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:48,222 INFO L93 Difference]: Finished difference Result 325 states and 382 transitions. [2024-11-20 14:52:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:52:48,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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 31 [2024-11-20 14:52:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:48,225 INFO L225 Difference]: With dead ends: 325 [2024-11-20 14:52:48,226 INFO L226 Difference]: Without dead ends: 325 [2024-11-20 14:52:48,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-20 14:52:48,227 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 522 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:48,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 816 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:52:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-20 14:52:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2024-11-20 14:52:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 195 states have (on average 1.4512820512820512) internal successors, (283), 228 states have internal predecessors, (283), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 290 transitions. [2024-11-20 14:52:48,235 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 290 transitions. Word has length 31 [2024-11-20 14:52:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:48,236 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 290 transitions. [2024-11-20 14:52:48,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 14:52:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 290 transitions. [2024-11-20 14:52:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 14:52:48,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:48,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:48,248 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-20 14:52:48,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:48,439 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:48,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -527258123, now seen corresponding path program 1 times [2024-11-20 14:52:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542052705] [2024-11-20 14:52:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:48,554 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-20 14:52:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542052705] [2024-11-20 14:52:48,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542052705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:48,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514275560] [2024-11-20 14:52:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:48,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:48,556 INFO L87 Difference]: Start difference. First operand 230 states and 290 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-20 14:52:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:48,701 INFO L93 Difference]: Finished difference Result 229 states and 289 transitions. [2024-11-20 14:52:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:48,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-20 14:52:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:48,702 INFO L225 Difference]: With dead ends: 229 [2024-11-20 14:52:48,702 INFO L226 Difference]: Without dead ends: 229 [2024-11-20 14:52:48,703 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-20 14:52:48,703 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 2 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:48,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 434 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-20 14:52:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-20 14:52:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 195 states have (on average 1.4461538461538461) internal successors, (282), 227 states have internal predecessors, (282), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 289 transitions. [2024-11-20 14:52:48,708 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 289 transitions. Word has length 33 [2024-11-20 14:52:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:48,708 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 289 transitions. [2024-11-20 14:52:48,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-20 14:52:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 289 transitions. [2024-11-20 14:52:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 14:52:48,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:48,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:48,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:52:48,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:48,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash -527258122, now seen corresponding path program 1 times [2024-11-20 14:52:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:48,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691063273] [2024-11-20 14:52:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:48,865 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-20 14:52:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691063273] [2024-11-20 14:52:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691063273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:48,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:48,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:52:48,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672227796] [2024-11-20 14:52:48,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:48,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:48,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:48,867 INFO L87 Difference]: Start difference. First operand 229 states and 289 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-20 14:52:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:49,017 INFO L93 Difference]: Finished difference Result 228 states and 288 transitions. [2024-11-20 14:52:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:52:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-20 14:52:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:49,020 INFO L225 Difference]: With dead ends: 228 [2024-11-20 14:52:49,020 INFO L226 Difference]: Without dead ends: 228 [2024-11-20 14:52:49,021 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-20 14:52:49,021 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:49,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-20 14:52:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-20 14:52:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.441025641025641) internal successors, (281), 226 states have internal predecessors, (281), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 288 transitions. [2024-11-20 14:52:49,027 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 288 transitions. Word has length 33 [2024-11-20 14:52:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 288 transitions. [2024-11-20 14:52:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-20 14:52:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 288 transitions. [2024-11-20 14:52:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:52:49,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:49,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:49,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 14:52:49,045 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1005529021, now seen corresponding path program 1 times [2024-11-20 14:52:49,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577645709] [2024-11-20 14:52:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:49,584 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-20 14:52:49,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:49,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577645709] [2024-11-20 14:52:49,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577645709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:49,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 14:52:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008454131] [2024-11-20 14:52:49,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:52:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:52:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:52:49,587 INFO L87 Difference]: Start difference. First operand 228 states and 288 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 14:52:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:50,270 INFO L93 Difference]: Finished difference Result 291 states and 344 transitions. [2024-11-20 14:52:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 14:52:50,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-20 14:52:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:50,271 INFO L225 Difference]: With dead ends: 291 [2024-11-20 14:52:50,272 INFO L226 Difference]: Without dead ends: 291 [2024-11-20 14:52:50,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2024-11-20 14:52:50,273 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 662 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:50,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 833 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:52:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-20 14:52:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 229. [2024-11-20 14:52:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 227 states have internal predecessors, (279), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 286 transitions. [2024-11-20 14:52:50,278 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 286 transitions. Word has length 34 [2024-11-20 14:52:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:50,278 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 286 transitions. [2024-11-20 14:52:50,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 14:52:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 286 transitions. [2024-11-20 14:52:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:52:50,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:50,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 14:52:50,279 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:50,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1005529022, now seen corresponding path program 1 times [2024-11-20 14:52:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500469809] [2024-11-20 14:52:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:50,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:50,725 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-20 14:52:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500469809] [2024-11-20 14:52:50,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500469809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:50,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:52:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161537788] [2024-11-20 14:52:50,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:50,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:52:50,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:52:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:52:50,728 INFO L87 Difference]: Start difference. First operand 229 states and 286 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 14:52:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:51,355 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2024-11-20 14:52:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:52:51,356 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-20 14:52:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:51,357 INFO L225 Difference]: With dead ends: 306 [2024-11-20 14:52:51,357 INFO L226 Difference]: Without dead ends: 306 [2024-11-20 14:52:51,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:52:51,358 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 395 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:51,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 855 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 14:52:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-20 14:52:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 235. [2024-11-20 14:52:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.4019607843137254) internal successors, (286), 233 states have internal predecessors, (286), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 293 transitions. [2024-11-20 14:52:51,366 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 293 transitions. Word has length 34 [2024-11-20 14:52:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:51,366 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 293 transitions. [2024-11-20 14:52:51,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 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-20 14:52:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 293 transitions. [2024-11-20 14:52:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 14:52:51,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:51,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:51,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 14:52:51,379 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:51,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash -906959725, now seen corresponding path program 1 times [2024-11-20 14:52:51,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:51,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245997678] [2024-11-20 14:52:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:51,437 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-20 14:52:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:51,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245997678] [2024-11-20 14:52:51,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245997678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:51,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006967458] [2024-11-20 14:52:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:51,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:51,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:51,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:51,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:51,440 INFO L87 Difference]: Start difference. First operand 235 states and 293 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:51,450 INFO L93 Difference]: Finished difference Result 236 states and 294 transitions. [2024-11-20 14:52:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-20 14:52:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:51,452 INFO L225 Difference]: With dead ends: 236 [2024-11-20 14:52:51,452 INFO L226 Difference]: Without dead ends: 236 [2024-11-20 14:52:51,453 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-20 14:52:51,453 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 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-20 14:52:51,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:52:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-20 14:52:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-20 14:52:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 205 states have (on average 1.4) internal successors, (287), 234 states have internal predecessors, (287), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 294 transitions. [2024-11-20 14:52:51,459 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 294 transitions. Word has length 37 [2024-11-20 14:52:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:51,460 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 294 transitions. [2024-11-20 14:52:51,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 294 transitions. [2024-11-20 14:52:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 14:52:51,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:51,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:51,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:52:51,461 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash -851203752, now seen corresponding path program 1 times [2024-11-20 14:52:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:51,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339299103] [2024-11-20 14:52:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:51,735 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-20 14:52:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339299103] [2024-11-20 14:52:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339299103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:52:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005549736] [2024-11-20 14:52:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:51,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:52:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:52:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:52:51,738 INFO L87 Difference]: Start difference. First operand 236 states and 294 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 14:52:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:52,082 INFO L93 Difference]: Finished difference Result 236 states and 294 transitions. [2024-11-20 14:52:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:52:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-20 14:52:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:52,083 INFO L225 Difference]: With dead ends: 236 [2024-11-20 14:52:52,083 INFO L226 Difference]: Without dead ends: 236 [2024-11-20 14:52:52,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:52:52,084 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 69 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:52,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 655 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-20 14:52:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2024-11-20 14:52:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 205 states have (on average 1.395121951219512) internal successors, (286), 233 states have internal predecessors, (286), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 293 transitions. [2024-11-20 14:52:52,089 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 293 transitions. Word has length 36 [2024-11-20 14:52:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:52,090 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 293 transitions. [2024-11-20 14:52:52,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 14:52:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 293 transitions. [2024-11-20 14:52:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 14:52:52,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:52,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:52,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 14:52:52,091 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:52,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash -851203751, now seen corresponding path program 1 times [2024-11-20 14:52:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:52,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682464183] [2024-11-20 14:52:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:52,489 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-20 14:52:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:52,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682464183] [2024-11-20 14:52:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682464183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:52,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:52:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64541901] [2024-11-20 14:52:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:52,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:52:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:52:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:52:52,492 INFO L87 Difference]: Start difference. First operand 235 states and 293 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 14:52:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:52,850 INFO L93 Difference]: Finished difference Result 235 states and 293 transitions. [2024-11-20 14:52:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:52:52,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-20 14:52:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:52,851 INFO L225 Difference]: With dead ends: 235 [2024-11-20 14:52:52,851 INFO L226 Difference]: Without dead ends: 235 [2024-11-20 14:52:52,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:52:52,852 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 66 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:52,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 665 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-20 14:52:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2024-11-20 14:52:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 205 states have (on average 1.3902439024390243) internal successors, (285), 232 states have internal predecessors, (285), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2024-11-20 14:52:52,857 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 36 [2024-11-20 14:52:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2024-11-20 14:52:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 14:52:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2024-11-20 14:52:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 14:52:52,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:52,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:52,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 14:52:52,859 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:52,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1788092553, now seen corresponding path program 1 times [2024-11-20 14:52:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:52,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619018465] [2024-11-20 14:52:52,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:52,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619018465] [2024-11-20 14:52:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619018465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:52:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119586819] [2024-11-20 14:52:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:52,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:52:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:52:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:52:52,977 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:53,176 INFO L93 Difference]: Finished difference Result 247 states and 305 transitions. [2024-11-20 14:52:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:52:53,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-20 14:52:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:53,178 INFO L225 Difference]: With dead ends: 247 [2024-11-20 14:52:53,178 INFO L226 Difference]: Without dead ends: 247 [2024-11-20 14:52:53,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:52:53,179 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 16 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:53,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 555 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-20 14:52:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2024-11-20 14:52:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 214 states have (on average 1.3738317757009346) internal successors, (294), 241 states have internal predecessors, (294), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 301 transitions. [2024-11-20 14:52:53,184 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 301 transitions. Word has length 38 [2024-11-20 14:52:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 301 transitions. [2024-11-20 14:52:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 301 transitions. [2024-11-20 14:52:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 14:52:53,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:53,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:53,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 14:52:53,185 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:53,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash -589068519, now seen corresponding path program 1 times [2024-11-20 14:52:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934394268] [2024-11-20 14:52:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:54,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-20 14:52:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934394268] [2024-11-20 14:52:54,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934394268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:54,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:54,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 14:52:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533327075] [2024-11-20 14:52:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:54,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:52:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:52:54,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:52:54,006 INFO L87 Difference]: Start difference. First operand 243 states and 301 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:55,098 INFO L93 Difference]: Finished difference Result 423 states and 498 transitions. [2024-11-20 14:52:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 14:52:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-20 14:52:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:55,099 INFO L225 Difference]: With dead ends: 423 [2024-11-20 14:52:55,099 INFO L226 Difference]: Without dead ends: 423 [2024-11-20 14:52:55,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2024-11-20 14:52:55,101 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 865 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:55,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 987 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 14:52:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-20 14:52:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 277. [2024-11-20 14:52:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 248 states have (on average 1.346774193548387) internal successors, (334), 275 states have internal predecessors, (334), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2024-11-20 14:52:55,108 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 38 [2024-11-20 14:52:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:55,108 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2024-11-20 14:52:55,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2024-11-20 14:52:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 14:52:55,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:55,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:55,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 14:52:55,109 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:55,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1725312744, now seen corresponding path program 1 times [2024-11-20 14:52:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337355884] [2024-11-20 14:52:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337355884] [2024-11-20 14:52:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337355884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:55,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:55,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:52:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117845246] [2024-11-20 14:52:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:55,149 INFO L87 Difference]: Start difference. First operand 277 states and 341 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-20 14:52:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:55,197 INFO L93 Difference]: Finished difference Result 286 states and 345 transitions. [2024-11-20 14:52:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-11-20 14:52:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:55,199 INFO L225 Difference]: With dead ends: 286 [2024-11-20 14:52:55,199 INFO L226 Difference]: Without dead ends: 286 [2024-11-20 14:52:55,199 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-20 14:52:55,200 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 91 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:55,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 153 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:52:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-20 14:52:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 278. [2024-11-20 14:52:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 276 states have internal predecessors, (335), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2024-11-20 14:52:55,206 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 38 [2024-11-20 14:52:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:55,206 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2024-11-20 14:52:55,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-20 14:52:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2024-11-20 14:52:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-20 14:52:55,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:55,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:55,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-20 14:52:55,207 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:55,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1619601304, now seen corresponding path program 1 times [2024-11-20 14:52:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:55,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980965273] [2024-11-20 14:52:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:55,335 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-20 14:52:55,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:55,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980965273] [2024-11-20 14:52:55,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980965273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:55,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:55,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:52:55,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999609792] [2024-11-20 14:52:55,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:52:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:55,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:52:55,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:52:55,338 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:55,526 INFO L93 Difference]: Finished difference Result 288 states and 352 transitions. [2024-11-20 14:52:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:52:55,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-20 14:52:55,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:55,527 INFO L225 Difference]: With dead ends: 288 [2024-11-20 14:52:55,527 INFO L226 Difference]: Without dead ends: 288 [2024-11-20 14:52:55,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:52:55,528 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:55,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 683 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:52:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-20 14:52:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2024-11-20 14:52:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 247 states have (on average 1.3400809716599191) internal successors, (331), 273 states have internal predecessors, (331), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 337 transitions. [2024-11-20 14:52:55,533 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 337 transitions. Word has length 39 [2024-11-20 14:52:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:55,534 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 337 transitions. [2024-11-20 14:52:55,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 337 transitions. [2024-11-20 14:52:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-20 14:52:55,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:55,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:55,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-20 14:52:55,536 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1028171501, now seen corresponding path program 1 times [2024-11-20 14:52:55,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:55,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157623230] [2024-11-20 14:52:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:56,187 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-20 14:52:56,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157623230] [2024-11-20 14:52:56,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157623230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:56,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:56,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 14:52:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024946127] [2024-11-20 14:52:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:52:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:52:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:52:56,190 INFO L87 Difference]: Start difference. First operand 275 states and 337 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:56,914 INFO L93 Difference]: Finished difference Result 348 states and 403 transitions. [2024-11-20 14:52:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:52:56,915 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-20 14:52:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:56,916 INFO L225 Difference]: With dead ends: 348 [2024-11-20 14:52:56,916 INFO L226 Difference]: Without dead ends: 348 [2024-11-20 14:52:56,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-11-20 14:52:56,917 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 487 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:56,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1018 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 14:52:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-20 14:52:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 275. [2024-11-20 14:52:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 273 states have internal predecessors, (330), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 336 transitions. [2024-11-20 14:52:56,922 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 336 transitions. Word has length 41 [2024-11-20 14:52:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:56,922 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 336 transitions. [2024-11-20 14:52:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 336 transitions. [2024-11-20 14:52:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-20 14:52:56,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:56,924 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:56,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-20 14:52:56,924 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash -917855289, now seen corresponding path program 1 times [2024-11-20 14:52:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:56,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281356681] [2024-11-20 14:52:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:57,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281356681] [2024-11-20 14:52:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281356681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:52:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508837239] [2024-11-20 14:52:57,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:57,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:57,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:57,146 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-20 14:52:57,147 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-20 14:52:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:57,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 14:52:57,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:52:57,263 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-20 14:52:57,268 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-20 14:52:57,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-20 14:52:57,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-20 14:52:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:57,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:52:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:57,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508837239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:52:57,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:52:57,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-20 14:52:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426943668] [2024-11-20 14:52:57,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:52:57,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:52:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:52:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:52:57,614 INFO L87 Difference]: Start difference. First operand 275 states and 336 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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-20 14:52:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:58,077 INFO L93 Difference]: Finished difference Result 384 states and 450 transitions. [2024-11-20 14:52:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 14:52:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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-20 14:52:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:58,080 INFO L225 Difference]: With dead ends: 384 [2024-11-20 14:52:58,080 INFO L226 Difference]: Without dead ends: 384 [2024-11-20 14:52:58,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:52:58,081 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 152 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:58,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 938 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-20 14:52:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2024-11-20 14:52:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 271 states have (on average 1.3468634686346863) internal successors, (365), 297 states have internal predecessors, (365), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 371 transitions. [2024-11-20 14:52:58,087 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 371 transitions. Word has length 41 [2024-11-20 14:52:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:58,087 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 371 transitions. [2024-11-20 14:52:58,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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-20 14:52:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 371 transitions. [2024-11-20 14:52:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:52:58,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:58,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:58,098 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-20 14:52:58,289 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,SelfDestructingSolverStorable32 [2024-11-20 14:52:58,290 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:58,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1611258309, now seen corresponding path program 1 times [2024-11-20 14:52:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872851400] [2024-11-20 14:52:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:58,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872851400] [2024-11-20 14:52:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872851400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:52:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679836229] [2024-11-20 14:52:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:58,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:58,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:52:58,376 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-20 14:52:58,377 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-20 14:52:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:58,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:52:58,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:52:58,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 14:52:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:58,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:52:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:58,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679836229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:52:58,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:52:58,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-20 14:52:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844790995] [2024-11-20 14:52:58,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:52:58,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:52:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:58,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:52:58,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:58,601 INFO L87 Difference]: Start difference. First operand 299 states and 371 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 14:52:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:58,694 INFO L93 Difference]: Finished difference Result 330 states and 402 transitions. [2024-11-20 14:52:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:52:58,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 42 [2024-11-20 14:52:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:58,696 INFO L225 Difference]: With dead ends: 330 [2024-11-20 14:52:58,696 INFO L226 Difference]: Without dead ends: 306 [2024-11-20 14:52:58,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:52:58,696 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:58,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-20 14:52:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-20 14:52:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 278 states have (on average 1.3381294964028776) internal successors, (372), 304 states have internal predecessors, (372), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 378 transitions. [2024-11-20 14:52:58,702 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 378 transitions. Word has length 42 [2024-11-20 14:52:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:58,702 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 378 transitions. [2024-11-20 14:52:58,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-20 14:52:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 378 transitions. [2024-11-20 14:52:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 14:52:58,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:58,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:58,712 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-20 14:52:58,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:52:58,908 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:58,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash 383547878, now seen corresponding path program 1 times [2024-11-20 14:52:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051061874] [2024-11-20 14:52:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:58,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051061874] [2024-11-20 14:52:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051061874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:58,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:52:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572652340] [2024-11-20 14:52:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:52:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:52:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:52:58,949 INFO L87 Difference]: Start difference. First operand 306 states and 378 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:59,005 INFO L93 Difference]: Finished difference Result 305 states and 374 transitions. [2024-11-20 14:52:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:52:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-20 14:52:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:59,007 INFO L225 Difference]: With dead ends: 305 [2024-11-20 14:52:59,007 INFO L226 Difference]: Without dead ends: 305 [2024-11-20 14:52:59,007 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-20 14:52:59,008 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:59,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 173 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:52:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-20 14:52:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-20 14:52:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 278 states have (on average 1.3273381294964028) internal successors, (369), 303 states have internal predecessors, (369), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2024-11-20 14:52:59,016 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 43 [2024-11-20 14:52:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:59,016 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2024-11-20 14:52:59,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2024-11-20 14:52:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:52:59,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:59,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:59,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-20 14:52:59,017 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:59,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1096004766, now seen corresponding path program 1 times [2024-11-20 14:52:59,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:59,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696226711] [2024-11-20 14:52:59,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:59,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:59,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:59,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696226711] [2024-11-20 14:52:59,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696226711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:59,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 14:52:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332432623] [2024-11-20 14:52:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:59,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:52:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:52:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:52:59,266 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 14:52:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:52:59,603 INFO L93 Difference]: Finished difference Result 339 states and 405 transitions. [2024-11-20 14:52:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:52:59,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-20 14:52:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:52:59,606 INFO L225 Difference]: With dead ends: 339 [2024-11-20 14:52:59,606 INFO L226 Difference]: Without dead ends: 339 [2024-11-20 14:52:59,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:52:59,607 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 423 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:52:59,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 436 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:52:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-20 14:52:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 312. [2024-11-20 14:52:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 285 states have (on average 1.3263157894736841) internal successors, (378), 310 states have internal predecessors, (378), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 383 transitions. [2024-11-20 14:52:59,613 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 383 transitions. Word has length 42 [2024-11-20 14:52:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:52:59,614 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 383 transitions. [2024-11-20 14:52:59,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 14:52:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 383 transitions. [2024-11-20 14:52:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:52:59,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:52:59,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:52:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-20 14:52:59,623 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:52:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:52:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1096004765, now seen corresponding path program 1 times [2024-11-20 14:52:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:52:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162193047] [2024-11-20 14:52:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:52:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:52:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:52:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:52:59,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:52:59,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162193047] [2024-11-20 14:52:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162193047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:52:59,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:52:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 14:52:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527541985] [2024-11-20 14:52:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:52:59,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:52:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:52:59,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:52:59,973 INFO L87 Difference]: Start difference. First operand 312 states and 383 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 14:53:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:53:00,367 INFO L93 Difference]: Finished difference Result 337 states and 404 transitions. [2024-11-20 14:53:00,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:53:00,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-20 14:53:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:53:00,369 INFO L225 Difference]: With dead ends: 337 [2024-11-20 14:53:00,369 INFO L226 Difference]: Without dead ends: 337 [2024-11-20 14:53:00,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:53:00,370 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 308 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:53:00,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 483 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:53:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-20 14:53:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 318. [2024-11-20 14:53:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 291 states have (on average 1.3230240549828178) internal successors, (385), 316 states have internal predecessors, (385), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:53:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2024-11-20 14:53:00,376 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 42 [2024-11-20 14:53:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:53:00,376 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2024-11-20 14:53:00,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-20 14:53:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2024-11-20 14:53:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 14:53:00,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:53:00,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:53:00,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-20 14:53:00,377 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-11-20 14:53:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:53:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash -255882895, now seen corresponding path program 1 times [2024-11-20 14:53:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:53:00,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764540171] [2024-11-20 14:53:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:53:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:53:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:53:00,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:53:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:53:00,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:53:00,439 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:53:00,440 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 68 remaining) [2024-11-20 14:53:00,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (66 of 68 remaining) [2024-11-20 14:53:00,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 68 remaining) [2024-11-20 14:53:00,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 68 remaining) [2024-11-20 14:53:00,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 68 remaining) [2024-11-20 14:53:00,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 68 remaining) [2024-11-20 14:53:00,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 68 remaining) [2024-11-20 14:53:00,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 68 remaining) [2024-11-20 14:53:00,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 68 remaining) [2024-11-20 14:53:00,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 68 remaining) [2024-11-20 14:53:00,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 68 remaining) [2024-11-20 14:53:00,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 68 remaining) [2024-11-20 14:53:00,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 68 remaining) [2024-11-20 14:53:00,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 68 remaining) [2024-11-20 14:53:00,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 68 remaining) [2024-11-20 14:53:00,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 68 remaining) [2024-11-20 14:53:00,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 68 remaining) [2024-11-20 14:53:00,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 68 remaining) [2024-11-20 14:53:00,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 68 remaining) [2024-11-20 14:53:00,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 68 remaining) [2024-11-20 14:53:00,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 68 remaining) [2024-11-20 14:53:00,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 68 remaining) [2024-11-20 14:53:00,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 68 remaining) [2024-11-20 14:53:00,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 68 remaining) [2024-11-20 14:53:00,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 68 remaining) [2024-11-20 14:53:00,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 68 remaining) [2024-11-20 14:53:00,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 68 remaining) [2024-11-20 14:53:00,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 68 remaining) [2024-11-20 14:53:00,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 68 remaining) [2024-11-20 14:53:00,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 68 remaining) [2024-11-20 14:53:00,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 68 remaining) [2024-11-20 14:53:00,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 68 remaining) [2024-11-20 14:53:00,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 68 remaining) [2024-11-20 14:53:00,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 68 remaining) [2024-11-20 14:53:00,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 68 remaining) [2024-11-20 14:53:00,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 68 remaining) [2024-11-20 14:53:00,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 68 remaining) [2024-11-20 14:53:00,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 68 remaining) [2024-11-20 14:53:00,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 68 remaining) [2024-11-20 14:53:00,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 68 remaining) [2024-11-20 14:53:00,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 68 remaining) [2024-11-20 14:53:00,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 68 remaining) [2024-11-20 14:53:00,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 68 remaining) [2024-11-20 14:53:00,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 68 remaining) [2024-11-20 14:53:00,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 68 remaining) [2024-11-20 14:53:00,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 68 remaining) [2024-11-20 14:53:00,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 68 remaining) [2024-11-20 14:53:00,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 68 remaining) [2024-11-20 14:53:00,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 68 remaining) [2024-11-20 14:53:00,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 68 remaining) [2024-11-20 14:53:00,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 68 remaining) [2024-11-20 14:53:00,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 68 remaining) [2024-11-20 14:53:00,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 68 remaining) [2024-11-20 14:53:00,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 68 remaining) [2024-11-20 14:53:00,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 68 remaining) [2024-11-20 14:53:00,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 68 remaining) [2024-11-20 14:53:00,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 68 remaining) [2024-11-20 14:53:00,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 68 remaining) [2024-11-20 14:53:00,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 68 remaining) [2024-11-20 14:53:00,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (8 of 68 remaining) [2024-11-20 14:53:00,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (7 of 68 remaining) [2024-11-20 14:53:00,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (6 of 68 remaining) [2024-11-20 14:53:00,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 68 remaining) [2024-11-20 14:53:00,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 68 remaining) [2024-11-20 14:53:00,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (3 of 68 remaining) [2024-11-20 14:53:00,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (2 of 68 remaining) [2024-11-20 14:53:00,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (1 of 68 remaining) [2024-11-20 14:53:00,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK (0 of 68 remaining) [2024-11-20 14:53:00,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-20 14:53:00,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:53:00,498 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 14:53:00,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:53:00 BoogieIcfgContainer [2024-11-20 14:53:00,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 14:53:00,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 14:53:00,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 14:53:00,504 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 14:53:00,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:52:40" (3/4) ... [2024-11-20 14:53:00,506 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 14:53:00,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 14:53:00,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 14:53:00,556 INFO L158 Benchmark]: Toolchain (without parser) took 22070.72ms. Allocated memory was 146.8MB in the beginning and 360.7MB in the end (delta: 213.9MB). Free memory was 112.9MB in the beginning and 308.5MB in the end (delta: -195.6MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-20 14:53:00,556 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:53:00,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.47ms. Allocated memory is still 146.8MB. Free memory was 112.9MB in the beginning and 92.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 14:53:00,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.39ms. Allocated memory is still 146.8MB. Free memory was 92.0MB in the beginning and 88.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 14:53:00,557 INFO L158 Benchmark]: Boogie Preprocessor took 87.68ms. Allocated memory is still 146.8MB. Free memory was 88.8MB in the beginning and 85.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:53:00,557 INFO L158 Benchmark]: RCFGBuilder took 924.87ms. Allocated memory is still 146.8MB. Free memory was 85.7MB in the beginning and 89.2MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 14:53:00,557 INFO L158 Benchmark]: TraceAbstraction took 20395.87ms. Allocated memory was 146.8MB in the beginning and 360.7MB in the end (delta: 213.9MB). Free memory was 88.2MB in the beginning and 311.6MB in the end (delta: -223.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:53:00,557 INFO L158 Benchmark]: Witness Printer took 51.88ms. Allocated memory is still 360.7MB. Free memory was 311.6MB in the beginning and 308.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:53:00,558 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.47ms. Allocated memory is still 146.8MB. Free memory was 112.9MB in the beginning and 92.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.39ms. Allocated memory is still 146.8MB. Free memory was 92.0MB in the beginning and 88.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.68ms. Allocated memory is still 146.8MB. Free memory was 88.8MB in the beginning and 85.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 924.87ms. Allocated memory is still 146.8MB. Free memory was 85.7MB in the beginning and 89.2MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20395.87ms. Allocated memory was 146.8MB in the beginning and 360.7MB in the end (delta: 213.9MB). Free memory was 88.2MB in the beginning and 311.6MB in the end (delta: -223.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.88ms. Allocated memory is still 360.7MB. Free memory was 311.6MB in the beginning and 308.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] inner->inner - UnprovableResult [Line: 992]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 200 locations, 68 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6095 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6095 mSDsluCounter, 18525 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13526 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9679 IncrementalHoareTripleChecker+Invalid, 9937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 4999 mSDtfsCounter, 9679 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=37, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 938 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1197 ConstructedInterpolants, 19 QuantifiedInterpolants, 11054 SizeOfPredicates, 12 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 43 InterpolantComputations, 34 PerfectInterpolantSequences, 16/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 14:53:00,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)