./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-circular-1.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 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:42:32,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:42:32,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:42:32,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:42:32,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:42:32,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:42:32,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:42:32,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:42:32,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:42:32,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:42:32,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:42:32,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:42:32,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:42:32,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:42:32,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:42:32,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:42:32,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:42:32,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:42:32,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:42:32,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:42:32,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:42:32,163 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:42:32,163 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:42:32,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:42:32,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:42:32,164 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:42:32,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:42:32,164 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:42:32,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:42:32,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:42:32,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:42:32,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:42:32,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:42:32,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:42:32,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:42:32,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:42:32,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:42:32,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:42:32,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:42:32,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:42:32,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:42:32,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:42:32,167 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2024-11-17 00:42:32,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:42:32,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:42:32,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:42:32,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:42:32,417 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:42:32,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2024-11-17 00:42:33,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:42:33,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:42:33,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2024-11-17 00:42:33,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c23d33d6/a8054d5e0526400da060b87a0f4577de/FLAGd71be0a5d [2024-11-17 00:42:34,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c23d33d6/a8054d5e0526400da060b87a0f4577de [2024-11-17 00:42:34,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:42:34,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:42:34,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:42:34,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:42:34,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:42:34,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce14464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34, skipping insertion in model container [2024-11-17 00:42:34,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:42:34,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:42:34,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:42:34,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:42:34,741 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:42:34,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34 WrapperNode [2024-11-17 00:42:34,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:42:34,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:42:34,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:42:34,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:42:34,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,789 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2024-11-17 00:42:34,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:42:34,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:42:34,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:42:34,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:42:34,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,823 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-17 00:42:34,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:42:34,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:42:34,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:42:34,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:42:34,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (1/1) ... [2024-11-17 00:42:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:42:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:34,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:42:34,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:42:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:42:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:42:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:42:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:42:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:42:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:42:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:42:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:42:34,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:42:35,090 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:42:35,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:42:35,362 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-17 00:42:35,362 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:42:35,379 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:42:35,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:42:35,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:42:35 BoogieIcfgContainer [2024-11-17 00:42:35,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:42:35,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:42:35,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:42:35,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:42:35,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:42:34" (1/3) ... [2024-11-17 00:42:35,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759953d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:42:35, skipping insertion in model container [2024-11-17 00:42:35,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:42:34" (2/3) ... [2024-11-17 00:42:35,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759953d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:42:35, skipping insertion in model container [2024-11-17 00:42:35,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:42:35" (3/3) ... [2024-11-17 00:42:35,389 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2024-11-17 00:42:35,404 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:42:35,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-17 00:42:35,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:42:35,458 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;@169fe40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:42:35,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-17 00:42:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 67 states have (on average 1.955223880597015) internal successors, (131), 111 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:42:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:42:35,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:35,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:42:35,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:35,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash 165798, now seen corresponding path program 1 times [2024-11-17 00:42:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33484930] [2024-11-17 00:42:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33484930] [2024-11-17 00:42:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33484930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:35,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:35,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:42:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147421508] [2024-11-17 00:42:35,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:35,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:35,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:35,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:35,720 INFO L87 Difference]: Start difference. First operand has 116 states, 67 states have (on average 1.955223880597015) internal successors, (131), 111 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:35,835 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2024-11-17 00:42:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 00:42:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:35,843 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:42:35,844 INFO L226 Difference]: Without dead ends: 104 [2024-11-17 00:42:35,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:35,850 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:35,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 97 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-17 00:42:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-17 00:42:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 102 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2024-11-17 00:42:35,883 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 3 [2024-11-17 00:42:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:35,884 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2024-11-17 00:42:35,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-11-17 00:42:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:42:35,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:35,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:42:35,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:42:35,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:35,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash 165799, now seen corresponding path program 1 times [2024-11-17 00:42:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584324270] [2024-11-17 00:42:35,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:35,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584324270] [2024-11-17 00:42:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584324270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:35,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:35,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:42:35,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518715326] [2024-11-17 00:42:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:35,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:35,988 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:36,088 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-11-17 00:42:36,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:36,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-17 00:42:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:36,089 INFO L225 Difference]: With dead ends: 100 [2024-11-17 00:42:36,089 INFO L226 Difference]: Without dead ends: 100 [2024-11-17 00:42:36,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:36,090 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:36,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 95 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-17 00:42:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-17 00:42:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.721311475409836) internal successors, (105), 98 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2024-11-17 00:42:36,096 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 3 [2024-11-17 00:42:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:36,097 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2024-11-17 00:42:36,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2024-11-17 00:42:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:42:36,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:36,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:36,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:42:36,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:36,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 812513019, now seen corresponding path program 1 times [2024-11-17 00:42:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686550021] [2024-11-17 00:42:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:36,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686550021] [2024-11-17 00:42:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686550021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554391402] [2024-11-17 00:42:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:42:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:42:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:42:36,215 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:36,350 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-17 00:42:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:42:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:36,351 INFO L225 Difference]: With dead ends: 89 [2024-11-17 00:42:36,351 INFO L226 Difference]: Without dead ends: 89 [2024-11-17 00:42:36,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:36,352 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 109 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:36,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 72 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-17 00:42:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-17 00:42:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.540983606557377) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-17 00:42:36,358 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 8 [2024-11-17 00:42:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:36,358 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-17 00:42:36,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-17 00:42:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:42:36,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:36,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:36,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:42:36,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash 812513020, now seen corresponding path program 1 times [2024-11-17 00:42:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638730675] [2024-11-17 00:42:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638730675] [2024-11-17 00:42:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638730675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:36,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:36,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438104122] [2024-11-17 00:42:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:36,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:42:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:36,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:42:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:42:36,496 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:36,614 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-17 00:42:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:42:36,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:42:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:36,615 INFO L225 Difference]: With dead ends: 95 [2024-11-17 00:42:36,615 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 00:42:36,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:36,618 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 70 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:36,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 121 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 00:42:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 00:42:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.507462686567164) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-17 00:42:36,623 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 8 [2024-11-17 00:42:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:36,623 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-17 00:42:36,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-17 00:42:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:42:36,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:36,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:36,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:42:36,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:36,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -813687088, now seen corresponding path program 1 times [2024-11-17 00:42:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015479227] [2024-11-17 00:42:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:36,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-17 00:42:36,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015479227] [2024-11-17 00:42:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015479227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:36,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:36,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:36,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828681385] [2024-11-17 00:42:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:36,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:36,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:36,737 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:36,891 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-11-17 00:42:36,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:42:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 00:42:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:36,892 INFO L225 Difference]: With dead ends: 94 [2024-11-17 00:42:36,892 INFO L226 Difference]: Without dead ends: 94 [2024-11-17 00:42:36,893 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-17 00:42:36,893 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 43 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:36,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-17 00:42:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-17 00:42:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.492537313432836) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-11-17 00:42:36,905 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 12 [2024-11-17 00:42:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:36,905 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-11-17 00:42:36,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-17 00:42:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:42:36,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:36,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:36,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:42:36,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash -813687087, now seen corresponding path program 1 times [2024-11-17 00:42:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337679932] [2024-11-17 00:42:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:37,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337679932] [2024-11-17 00:42:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337679932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:37,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810510371] [2024-11-17 00:42:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:37,108 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:37,248 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-17 00:42:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 00:42:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:37,249 INFO L225 Difference]: With dead ends: 89 [2024-11-17 00:42:37,250 INFO L226 Difference]: Without dead ends: 89 [2024-11-17 00:42:37,250 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-17 00:42:37,251 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 17 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:37,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 279 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-17 00:42:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2024-11-17 00:42:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2024-11-17 00:42:37,255 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 12 [2024-11-17 00:42:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:37,256 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2024-11-17 00:42:37,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2024-11-17 00:42:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:42:37,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:37,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:37,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:42:37,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2040089996, now seen corresponding path program 1 times [2024-11-17 00:42:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50673044] [2024-11-17 00:42:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:37,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50673044] [2024-11-17 00:42:37,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50673044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:37,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:37,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:42:37,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411806068] [2024-11-17 00:42:37,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:37,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:37,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:37,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:37,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:37,465 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-17 00:42:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:37,668 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2024-11-17 00:42:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:42:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-17 00:42:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:37,669 INFO L225 Difference]: With dead ends: 144 [2024-11-17 00:42:37,669 INFO L226 Difference]: Without dead ends: 144 [2024-11-17 00:42:37,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:42:37,670 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 196 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:37,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 382 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-17 00:42:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 90. [2024-11-17 00:42:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.411764705882353) internal successors, (96), 88 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-17 00:42:37,675 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 15 [2024-11-17 00:42:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:37,675 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-17 00:42:37,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-17 00:42:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-17 00:42:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:42:37,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:37,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:42:37,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:37,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2040117419, now seen corresponding path program 1 times [2024-11-17 00:42:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935968839] [2024-11-17 00:42:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:37,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935968839] [2024-11-17 00:42:37,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935968839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:37,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:37,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113701331] [2024-11-17 00:42:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:37,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:37,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:37,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:37,849 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:38,064 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2024-11-17 00:42:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:42:38,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-17 00:42:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:38,066 INFO L225 Difference]: With dead ends: 122 [2024-11-17 00:42:38,066 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 00:42:38,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:42:38,067 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 205 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:38,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 265 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 00:42:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2024-11-17 00:42:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.408450704225352) internal successors, (100), 91 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-17 00:42:38,071 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2024-11-17 00:42:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:38,072 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-17 00:42:38,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-17 00:42:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:42:38,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:38,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:42:38,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:38,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2040117418, now seen corresponding path program 1 times [2024-11-17 00:42:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720601696] [2024-11-17 00:42:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:38,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:38,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720601696] [2024-11-17 00:42:38,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720601696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:38,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:38,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:38,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361362536] [2024-11-17 00:42:38,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:38,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:38,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:38,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:38,339 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:38,574 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2024-11-17 00:42:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:42:38,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-17 00:42:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:38,575 INFO L225 Difference]: With dead ends: 144 [2024-11-17 00:42:38,575 INFO L226 Difference]: Without dead ends: 144 [2024-11-17 00:42:38,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:42:38,576 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 142 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:38,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 321 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-17 00:42:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 106. [2024-11-17 00:42:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2024-11-17 00:42:38,580 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 15 [2024-11-17 00:42:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:38,580 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2024-11-17 00:42:38,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2024-11-17 00:42:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:42:38,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:38,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:38,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:42:38,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -793986161, now seen corresponding path program 1 times [2024-11-17 00:42:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:38,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379832775] [2024-11-17 00:42:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379832775] [2024-11-17 00:42:38,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379832775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:38,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:42:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864059492] [2024-11-17 00:42:38,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:38,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:42:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:38,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:42:38,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:38,789 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:38,992 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-11-17 00:42:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:42:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:38,993 INFO L225 Difference]: With dead ends: 141 [2024-11-17 00:42:38,994 INFO L226 Difference]: Without dead ends: 141 [2024-11-17 00:42:38,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:42:38,995 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 193 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:38,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 436 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-17 00:42:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2024-11-17 00:42:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 104 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2024-11-17 00:42:39,004 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 19 [2024-11-17 00:42:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:39,004 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2024-11-17 00:42:39,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2024-11-17 00:42:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:42:39,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:39,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:39,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:42:39,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:39,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash -793986160, now seen corresponding path program 1 times [2024-11-17 00:42:39,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:39,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601967072] [2024-11-17 00:42:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:39,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:39,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601967072] [2024-11-17 00:42:39,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601967072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336890983] [2024-11-17 00:42:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:39,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:39,322 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:39,604 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2024-11-17 00:42:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:42:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:39,605 INFO L225 Difference]: With dead ends: 140 [2024-11-17 00:42:39,605 INFO L226 Difference]: Without dead ends: 140 [2024-11-17 00:42:39,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:42:39,606 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 141 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:39,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 308 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-17 00:42:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2024-11-17 00:42:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 104 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-11-17 00:42:39,610 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 19 [2024-11-17 00:42:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:39,611 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-11-17 00:42:39,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-11-17 00:42:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:42:39,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:39,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:39,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:42:39,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:39,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1322914377, now seen corresponding path program 1 times [2024-11-17 00:42:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705920492] [2024-11-17 00:42:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705920492] [2024-11-17 00:42:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705920492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:39,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:42:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046801476] [2024-11-17 00:42:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:39,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:39,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:39,681 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:39,757 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-11-17 00:42:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:39,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:42:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:39,758 INFO L225 Difference]: With dead ends: 108 [2024-11-17 00:42:39,758 INFO L226 Difference]: Without dead ends: 108 [2024-11-17 00:42:39,758 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-17 00:42:39,758 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:39,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 348 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-17 00:42:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-17 00:42:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.380952380952381) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-17 00:42:39,762 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 20 [2024-11-17 00:42:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:39,763 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-17 00:42:39,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-17 00:42:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:42:39,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:39,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:39,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:42:39,764 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:39,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1154326225, now seen corresponding path program 1 times [2024-11-17 00:42:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:39,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762738259] [2024-11-17 00:42:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:39,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762738259] [2024-11-17 00:42:39,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762738259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:39,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:39,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:42:39,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928666674] [2024-11-17 00:42:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:39,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:42:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:42:39,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:42:39,815 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:39,972 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2024-11-17 00:42:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:42:39,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:42:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:39,973 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:42:39,974 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:42:39,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:39,974 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 137 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:39,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 221 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:42:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2024-11-17 00:42:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 105 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-11-17 00:42:39,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 20 [2024-11-17 00:42:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:39,978 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-11-17 00:42:39,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-11-17 00:42:39,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:42:39,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:39,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:39,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:42:39,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:39,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1154326226, now seen corresponding path program 1 times [2024-11-17 00:42:39,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:39,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134780814] [2024-11-17 00:42:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134780814] [2024-11-17 00:42:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134780814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:40,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:40,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056638271] [2024-11-17 00:42:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:40,219 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:40,410 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-11-17 00:42:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:40,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-17 00:42:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:40,411 INFO L225 Difference]: With dead ends: 146 [2024-11-17 00:42:40,411 INFO L226 Difference]: Without dead ends: 146 [2024-11-17 00:42:40,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:40,412 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:40,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 263 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-17 00:42:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2024-11-17 00:42:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 130 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2024-11-17 00:42:40,416 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 20 [2024-11-17 00:42:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:40,416 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2024-11-17 00:42:40,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2024-11-17 00:42:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:42:40,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:40,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:40,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:42:40,420 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1270571540, now seen corresponding path program 1 times [2024-11-17 00:42:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:40,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123144656] [2024-11-17 00:42:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123144656] [2024-11-17 00:42:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123144656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:42:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489266883] [2024-11-17 00:42:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:42:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:40,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:42:40,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:42:40,572 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:40,721 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-11-17 00:42:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:40,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 00:42:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:40,722 INFO L225 Difference]: With dead ends: 147 [2024-11-17 00:42:40,722 INFO L226 Difference]: Without dead ends: 147 [2024-11-17 00:42:40,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:40,723 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:40,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 357 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-17 00:42:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2024-11-17 00:42:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4196428571428572) internal successors, (159), 131 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2024-11-17 00:42:40,725 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 23 [2024-11-17 00:42:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:40,726 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2024-11-17 00:42:40,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2024-11-17 00:42:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:42:40,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:40,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:40,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:42:40,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:40,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1051515167, now seen corresponding path program 1 times [2024-11-17 00:42:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037506167] [2024-11-17 00:42:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:40,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:40,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037506167] [2024-11-17 00:42:40,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037506167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:40,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:40,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781045582] [2024-11-17 00:42:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:40,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:40,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:40,760 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:42:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:40,767 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2024-11-17 00:42:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:40,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2024-11-17 00:42:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:40,769 INFO L225 Difference]: With dead ends: 148 [2024-11-17 00:42:40,769 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 00:42:40,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:40,770 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:40,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 00:42:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-17 00:42:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 145 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 177 transitions. [2024-11-17 00:42:40,775 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 177 transitions. Word has length 24 [2024-11-17 00:42:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:40,776 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 177 transitions. [2024-11-17 00:42:40,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-17 00:42:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2024-11-17 00:42:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:42:40,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:40,777 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] [2024-11-17 00:42:40,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:42:40,777 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:40,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1818324412, now seen corresponding path program 1 times [2024-11-17 00:42:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:40,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941767784] [2024-11-17 00:42:40,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:40,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941767784] [2024-11-17 00:42:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941767784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:40,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:42:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107354354] [2024-11-17 00:42:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:42:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:40,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:42:40,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:40,805 INFO L87 Difference]: Start difference. First operand 147 states and 177 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 00:42:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:40,811 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2024-11-17 00:42:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:42:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2024-11-17 00:42:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:40,812 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:42:40,812 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:42:40,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:42:40,812 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:40,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:42:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:42:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-17 00:42:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.37984496124031) internal successors, (178), 148 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2024-11-17 00:42:40,815 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 25 [2024-11-17 00:42:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:40,816 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2024-11-17 00:42:40,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 00:42:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2024-11-17 00:42:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:42:40,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:40,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:40,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:42:40,816 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:40,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash -889903733, now seen corresponding path program 1 times [2024-11-17 00:42:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:40,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484399166] [2024-11-17 00:42:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484399166] [2024-11-17 00:42:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484399166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:40,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:42:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643868651] [2024-11-17 00:42:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:40,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:42:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:42:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:42:40,866 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:40,945 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2024-11-17 00:42:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:42:40,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-17 00:42:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:40,946 INFO L225 Difference]: With dead ends: 149 [2024-11-17 00:42:40,946 INFO L226 Difference]: Without dead ends: 149 [2024-11-17 00:42:40,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:40,946 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:40,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 194 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-17 00:42:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-17 00:42:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 147 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2024-11-17 00:42:40,950 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 24 [2024-11-17 00:42:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:40,950 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2024-11-17 00:42:40,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2024-11-17 00:42:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:42:40,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:40,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:40,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:42:40,950 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -889903732, now seen corresponding path program 1 times [2024-11-17 00:42:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:40,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759383109] [2024-11-17 00:42:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:40,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:41,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:41,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759383109] [2024-11-17 00:42:41,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759383109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:41,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:41,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:42:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112608299] [2024-11-17 00:42:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:41,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:42:41,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:42:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:41,187 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:41,433 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2024-11-17 00:42:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:42:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-17 00:42:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:41,435 INFO L225 Difference]: With dead ends: 163 [2024-11-17 00:42:41,435 INFO L226 Difference]: Without dead ends: 163 [2024-11-17 00:42:41,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:42:41,436 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 194 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:41,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 403 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:42:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-17 00:42:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2024-11-17 00:42:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 147 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2024-11-17 00:42:41,439 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 24 [2024-11-17 00:42:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:41,440 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2024-11-17 00:42:41,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2024-11-17 00:42:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:42:41,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:41,440 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] [2024-11-17 00:42:41,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:42:41,441 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:41,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1246382611, now seen corresponding path program 1 times [2024-11-17 00:42:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042107567] [2024-11-17 00:42:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042107567] [2024-11-17 00:42:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042107567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:41,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:42:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029895587] [2024-11-17 00:42:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:42:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:41,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:42:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:42:41,583 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:41,711 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2024-11-17 00:42:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:42:41,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:42:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:41,711 INFO L225 Difference]: With dead ends: 163 [2024-11-17 00:42:41,712 INFO L226 Difference]: Without dead ends: 163 [2024-11-17 00:42:41,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:42:41,712 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 130 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:41,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 265 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-17 00:42:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2024-11-17 00:42:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 148 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 177 transitions. [2024-11-17 00:42:41,715 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 177 transitions. Word has length 25 [2024-11-17 00:42:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:41,715 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 177 transitions. [2024-11-17 00:42:41,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 177 transitions. [2024-11-17 00:42:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:42:41,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:41,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, 1, 1, 1, 1] [2024-11-17 00:42:41,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:42:41,716 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:41,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1549609207, now seen corresponding path program 1 times [2024-11-17 00:42:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:41,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798421935] [2024-11-17 00:42:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:41,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798421935] [2024-11-17 00:42:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798421935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:41,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:41,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:42:41,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733274324] [2024-11-17 00:42:41,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:41,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:42:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:41,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:42:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:42:41,891 INFO L87 Difference]: Start difference. First operand 150 states and 177 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:42,044 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2024-11-17 00:42:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:42:42,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-17 00:42:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:42,045 INFO L225 Difference]: With dead ends: 164 [2024-11-17 00:42:42,045 INFO L226 Difference]: Without dead ends: 158 [2024-11-17 00:42:42,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:42:42,046 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 62 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:42,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 327 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-17 00:42:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2024-11-17 00:42:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 128 states have (on average 1.34375) internal successors, (172), 146 states have internal predecessors, (172), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2024-11-17 00:42:42,049 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 27 [2024-11-17 00:42:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:42,049 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2024-11-17 00:42:42,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2024-11-17 00:42:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:42:42,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:42,050 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] [2024-11-17 00:42:42,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:42:42,050 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:42,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash 584950468, now seen corresponding path program 1 times [2024-11-17 00:42:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091482675] [2024-11-17 00:42:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091482675] [2024-11-17 00:42:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091482675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:42,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:42:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8429256] [2024-11-17 00:42:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:42:42,096 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:42,204 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2024-11-17 00:42:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:42:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-17 00:42:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:42,205 INFO L225 Difference]: With dead ends: 151 [2024-11-17 00:42:42,205 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 00:42:42,205 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-17 00:42:42,206 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 46 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:42,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 202 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 00:42:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-11-17 00:42:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.3384615384615384) internal successors, (174), 148 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2024-11-17 00:42:42,208 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 27 [2024-11-17 00:42:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:42,209 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2024-11-17 00:42:42,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2024-11-17 00:42:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:42:42,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:42,209 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] [2024-11-17 00:42:42,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:42:42,210 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash 584950469, now seen corresponding path program 1 times [2024-11-17 00:42:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215430387] [2024-11-17 00:42:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215430387] [2024-11-17 00:42:42,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215430387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403374523] [2024-11-17 00:42:42,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:42,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:42,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:42,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:42,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:42:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:42,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:42:42,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:42,637 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 23 treesize of output 15 [2024-11-17 00:42:42,644 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 28 treesize of output 16 [2024-11-17 00:42:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:42,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:42:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403374523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:42,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:42:42,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-17 00:42:42,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519495573] [2024-11-17 00:42:42,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:42:42,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:42:42,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:42:42,679 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:42,821 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2024-11-17 00:42:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:42:42,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-17 00:42:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:42,822 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:42:42,823 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:42:42,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:42:42,823 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 33 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:42,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 224 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:42:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2024-11-17 00:42:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 147 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2024-11-17 00:42:42,826 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 27 [2024-11-17 00:42:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2024-11-17 00:42:42,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2024-11-17 00:42:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:42:42,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:42,827 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:42,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:42:43,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-17 00:42:43,028 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:43,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -508665961, now seen corresponding path program 1 times [2024-11-17 00:42:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354410891] [2024-11-17 00:42:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354410891] [2024-11-17 00:42:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354410891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879552538] [2024-11-17 00:42:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:43,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:43,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:43,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:42:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:43,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 00:42:43,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:43,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:42:43,407 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:42:43,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:42:43,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:42:43,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:42:43,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:42:43,548 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:42:43,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-17 00:42:43,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:42:43,641 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:42:43,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-17 00:42:43,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-17 00:42:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:43,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:43,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-11-17 00:42:43,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:43,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-17 00:42:43,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:43,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2024-11-17 00:42:43,933 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 20 treesize of output 18 [2024-11-17 00:42:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-17 00:42:44,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879552538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:42:44,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:42:44,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 26 [2024-11-17 00:42:44,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014456129] [2024-11-17 00:42:44,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:42:44,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:42:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:42:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=525, Unknown=1, NotChecked=46, Total=650 [2024-11-17 00:42:44,067 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 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-17 00:42:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:44,635 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2024-11-17 00:42:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:42:44,636 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 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 28 [2024-11-17 00:42:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:44,636 INFO L225 Difference]: With dead ends: 234 [2024-11-17 00:42:44,637 INFO L226 Difference]: Without dead ends: 234 [2024-11-17 00:42:44,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=968, Unknown=1, NotChecked=64, Total=1190 [2024-11-17 00:42:44,638 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 258 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:44,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 753 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 728 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2024-11-17 00:42:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-17 00:42:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 174. [2024-11-17 00:42:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 172 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2024-11-17 00:42:44,641 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 28 [2024-11-17 00:42:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:44,641 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2024-11-17 00:42:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 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-17 00:42:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2024-11-17 00:42:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:42:44,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:44,642 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-17 00:42:44,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:42:44,842 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,SelfDestructingSolverStorable23 [2024-11-17 00:42:44,842 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -673333311, now seen corresponding path program 1 times [2024-11-17 00:42:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228004638] [2024-11-17 00:42:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:45,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:45,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228004638] [2024-11-17 00:42:45,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228004638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:42:45,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:42:45,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:42:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272680889] [2024-11-17 00:42:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:42:45,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:42:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:42:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:42:45,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:42:45,200 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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-17 00:42:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:42:45,446 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2024-11-17 00:42:45,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:42:45,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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-17 00:42:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:42:45,447 INFO L225 Difference]: With dead ends: 183 [2024-11-17 00:42:45,447 INFO L226 Difference]: Without dead ends: 183 [2024-11-17 00:42:45,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:42:45,447 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 165 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:42:45,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 489 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:42:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-17 00:42:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2024-11-17 00:42:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 171 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:42:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2024-11-17 00:42:45,450 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 29 [2024-11-17 00:42:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:42:45,451 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2024-11-17 00:42:45,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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-17 00:42:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2024-11-17 00:42:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:42:45,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:42:45,451 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:42:45,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 00:42:45,452 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 41 more)] === [2024-11-17 00:42:45,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:42:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash -508693384, now seen corresponding path program 1 times [2024-11-17 00:42:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:42:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157593193] [2024-11-17 00:42:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:42:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:45,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:42:45,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157593193] [2024-11-17 00:42:45,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157593193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:42:45,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105813239] [2024-11-17 00:42:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:42:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:42:45,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:42:45,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:42:45,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:42:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:42:45,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:42:45,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:42:45,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:42:45,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:42:45,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:42:45,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:42:45,903 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 00:42:45,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-17 00:42:45,952 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:42:45,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-17 00:42:46,011 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:42:46,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2024-11-17 00:42:46,034 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:42:46,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2024-11-17 00:42:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:42:46,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:42:46,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_659) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_659 .cse0))) v_ArrVal_659)))) is different from false [2024-11-17 00:42:46,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_50| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_50| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_659) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (< |c_ULTIMATE.start_main_#t~mem4#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_50|) (not (= v_ArrVal_659 (let ((.cse0 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|))) (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_50| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_659 .cse0))))))) is different from false [2024-11-17 00:42:46,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_50| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_50| 0) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_50|) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_659) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= v_ArrVal_659 (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_50|))) (store (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_50| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1 (select v_ArrVal_659 .cse1)))))))) is different from false [2024-11-17 00:42:46,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:46,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2024-11-17 00:42:46,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:46,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2024-11-17 00:42:46,291 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 6 treesize of output 4 [2024-11-17 00:42:46,311 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 7 treesize of output 5 [2024-11-17 00:42:46,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:46,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-11-17 00:42:46,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:46,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 197 [2024-11-17 00:42:59,757 WARN L286 SmtUtils]: Spent 11.66s on a formula simplification that was a NOOP. DAG size: 2313 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-17 00:42:59,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:42:59,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 561 case distinctions, treesize of input 997 treesize of output 5414