./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-reverse_simple.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-reverse_simple.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 a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:43:11,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:43:11,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:43:11,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:43:11,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:43:11,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:43:11,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:43:11,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:43:11,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:43:11,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:43:11,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:43:11,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:43:11,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:43:11,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:43:11,783 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:43:11,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:43:11,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:43:11,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:43:11,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:43:11,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:43:11,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:43:11,786 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:43:11,786 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:43:11,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:43:11,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:43:11,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:43:11,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:43:11,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:43:11,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:43:11,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:43:11,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:43:11,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:43:11,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:43:11,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:43:11,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:43:11,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:43:11,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:43:11,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:43:11,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:43:11,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:43:11,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:43:11,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:43:11,793 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 -> a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba [2024-11-17 00:43:12,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:43:12,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:43:12,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:43:12,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:43:12,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:43:12,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2024-11-17 00:43:13,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:43:13,740 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:43:13,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2024-11-17 00:43:13,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b6933fa/dfa6ebb2c9cf4f198db2475796e67f95/FLAGff7dabf4e [2024-11-17 00:43:13,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b6933fa/dfa6ebb2c9cf4f198db2475796e67f95 [2024-11-17 00:43:13,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:43:13,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:43:13,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:43:13,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:43:13,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:43:13,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:43:13" (1/1) ... [2024-11-17 00:43:13,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd3c34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:13, skipping insertion in model container [2024-11-17 00:43:13,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:43:13" (1/1) ... [2024-11-17 00:43:13,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:43:14,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:43:14,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:43:14,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:43:14,227 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:43:14,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14 WrapperNode [2024-11-17 00:43:14,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:43:14,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:43:14,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:43:14,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:43:14,236 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:43:14" (1/1) ... [2024-11-17 00:43:14,254 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:43:14" (1/1) ... [2024-11-17 00:43:14,282 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2024-11-17 00:43:14,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:43:14,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:43:14,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:43:14,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:43:14,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,322 INFO L175 MemorySlicer]: Split 27 memory accesses to 2 slices as follows [2, 25]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-17 00:43:14,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:43:14,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:43:14,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:43:14,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:43:14,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (1/1) ... [2024-11-17 00:43:14,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:43:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:43:14,394 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:43:14,396 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:43:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:43:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:43:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:43:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:43:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:43:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:43:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:43:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:43:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:43:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:43:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:43:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:43:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:43:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:43:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:43:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:43:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:43:14,555 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:43:14,557 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:43:14,958 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-17 00:43:14,959 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:43:14,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:43:14,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:43:14,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:43:14 BoogieIcfgContainer [2024-11-17 00:43:14,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:43:14,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:43:14,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:43:14,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:43:14,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:43:13" (1/3) ... [2024-11-17 00:43:14,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33373560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:43:14, skipping insertion in model container [2024-11-17 00:43:14,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:43:14" (2/3) ... [2024-11-17 00:43:14,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33373560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:43:14, skipping insertion in model container [2024-11-17 00:43:14,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:43:14" (3/3) ... [2024-11-17 00:43:14,989 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2024-11-17 00:43:15,010 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:43:15,011 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-11-17 00:43:15,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:43:15,072 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;@318f3654, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:43:15,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-17 00:43:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 138 states have internal predecessors, (162), 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:43:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:43:15,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:15,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:43:15,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 196581, now seen corresponding path program 1 times [2024-11-17 00:43:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223005693] [2024-11-17 00:43:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:15,338 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:43:15,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223005693] [2024-11-17 00:43:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223005693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:15,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:15,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:43:15,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303517055] [2024-11-17 00:43:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:15,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:43:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:43:15,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:43:15,380 INFO L87 Difference]: Start difference. First operand has 143 states, 83 states have (on average 1.9518072289156627) internal successors, (162), 138 states have internal predecessors, (162), 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:43:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:15,554 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-17 00:43:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:43:15,556 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:43:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:15,564 INFO L225 Difference]: With dead ends: 136 [2024-11-17 00:43:15,564 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:43:15,566 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:43:15,569 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 68 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:15,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 149 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:43:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:43:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-17 00:43:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 77 states have (on average 1.8181818181818181) internal successors, (140), 131 states have internal predecessors, (140), 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:43:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2024-11-17 00:43:15,613 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 3 [2024-11-17 00:43:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:15,613 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2024-11-17 00:43:15,613 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:43:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2024-11-17 00:43:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:43:15,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:15,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:43:15,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:43:15,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:15,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash 196582, now seen corresponding path program 1 times [2024-11-17 00:43:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:15,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020871298] [2024-11-17 00:43:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:15,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:15,727 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:43:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:15,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020871298] [2024-11-17 00:43:15,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020871298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:15,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:15,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:43:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080743373] [2024-11-17 00:43:15,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:15,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:43:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:43:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:43:15,732 INFO L87 Difference]: Start difference. First operand 133 states and 143 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:43:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:15,907 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2024-11-17 00:43:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:43:15,908 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:43:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:15,909 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:43:15,909 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:43:15,909 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:43:15,910 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:15,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 144 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:43:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-17 00:43:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 129 states have internal predecessors, (138), 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:43:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2024-11-17 00:43:15,919 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 3 [2024-11-17 00:43:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2024-11-17 00:43:15,920 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:43:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2024-11-17 00:43:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:43:15,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:15,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:15,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:43:15,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:15,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:15,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1664956118, now seen corresponding path program 1 times [2024-11-17 00:43:15,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552748404] [2024-11-17 00:43:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:16,054 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:43:16,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:16,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552748404] [2024-11-17 00:43:16,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552748404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:16,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:43:16,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308246418] [2024-11-17 00:43:16,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:16,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:43:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:16,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:43:16,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:43:16,059 INFO L87 Difference]: Start difference. First operand 131 states and 141 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:43:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:16,236 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-11-17 00:43:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:43:16,236 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:43:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:16,237 INFO L225 Difference]: With dead ends: 123 [2024-11-17 00:43:16,238 INFO L226 Difference]: Without dead ends: 123 [2024-11-17 00:43:16,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:43:16,239 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 103 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:16,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 112 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-17 00:43:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-17 00:43:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.6144578313253013) internal successors, (134), 121 states have internal predecessors, (134), 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:43:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2024-11-17 00:43:16,247 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 8 [2024-11-17 00:43:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:16,247 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2024-11-17 00:43:16,248 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:43:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2024-11-17 00:43:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:43:16,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:16,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:16,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:43:16,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:16,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1664956119, now seen corresponding path program 1 times [2024-11-17 00:43:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282417788] [2024-11-17 00:43:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:16,402 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:43:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:16,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282417788] [2024-11-17 00:43:16,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282417788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:16,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:16,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:43:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381984934] [2024-11-17 00:43:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:16,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:43:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:43:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:43:16,405 INFO L87 Difference]: Start difference. First operand 123 states and 137 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:43:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:16,611 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2024-11-17 00:43:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:43:16,611 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:43:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:16,612 INFO L225 Difference]: With dead ends: 151 [2024-11-17 00:43:16,614 INFO L226 Difference]: Without dead ends: 151 [2024-11-17 00:43:16,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:43:16,615 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 113 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:16,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 158 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-17 00:43:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2024-11-17 00:43:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.514018691588785) internal successors, (162), 145 states have internal predecessors, (162), 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:43:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2024-11-17 00:43:16,624 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 8 [2024-11-17 00:43:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2024-11-17 00:43:16,624 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:43:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2024-11-17 00:43:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:43:16,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:16,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:16,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:43:16,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:16,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2119029232, now seen corresponding path program 1 times [2024-11-17 00:43:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890912108] [2024-11-17 00:43:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:16,760 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:43:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890912108] [2024-11-17 00:43:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890912108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:16,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:43:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413449125] [2024-11-17 00:43:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:16,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:43:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:43:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:43:16,763 INFO L87 Difference]: Start difference. First operand 147 states and 165 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:43:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:17,004 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-11-17 00:43:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:43:17,004 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:43:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:17,005 INFO L225 Difference]: With dead ends: 147 [2024-11-17 00:43:17,005 INFO L226 Difference]: Without dead ends: 147 [2024-11-17 00:43:17,006 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:43:17,007 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 41 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:17,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 268 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-17 00:43:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-17 00:43:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.5046728971962617) internal successors, (161), 144 states have internal predecessors, (161), 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:43:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-11-17 00:43:17,027 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 12 [2024-11-17 00:43:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:17,027 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-11-17 00:43:17,028 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:43:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-11-17 00:43:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:43:17,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:17,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:17,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:43:17,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2119029231, now seen corresponding path program 1 times [2024-11-17 00:43:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790615794] [2024-11-17 00:43:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:17,227 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:43:17,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:17,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790615794] [2024-11-17 00:43:17,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790615794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:17,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:17,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:43:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292751805] [2024-11-17 00:43:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:17,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:43:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:43:17,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:43:17,232 INFO L87 Difference]: Start difference. First operand 146 states and 164 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:43:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:17,453 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2024-11-17 00:43:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:43:17,454 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:43:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:17,459 INFO L225 Difference]: With dead ends: 143 [2024-11-17 00:43:17,459 INFO L226 Difference]: Without dead ends: 143 [2024-11-17 00:43:17,459 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:43:17,460 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:17,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 366 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-17 00:43:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2024-11-17 00:43:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 135 states have internal predecessors, (151), 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:43:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2024-11-17 00:43:17,468 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 12 [2024-11-17 00:43:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:17,468 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2024-11-17 00:43:17,468 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:43:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2024-11-17 00:43:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:43:17,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:17,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:17,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:43:17,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:17,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1804163567, now seen corresponding path program 1 times [2024-11-17 00:43:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:17,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583836844] [2024-11-17 00:43:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:17,662 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:43:17,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:17,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583836844] [2024-11-17 00:43:17,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583836844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:43:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559227551] [2024-11-17 00:43:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:17,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:43:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:43:17,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:43:17,665 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:43:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:17,846 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2024-11-17 00:43:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:43:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 18 [2024-11-17 00:43:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:17,847 INFO L225 Difference]: With dead ends: 157 [2024-11-17 00:43:17,847 INFO L226 Difference]: Without dead ends: 157 [2024-11-17 00:43:17,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:43:17,849 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 29 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:17,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 442 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:43:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-17 00:43:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-11-17 00:43:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 144 states have internal predecessors, (161), 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:43:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-11-17 00:43:17,853 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 18 [2024-11-17 00:43:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:17,854 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-11-17 00:43:17,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:43:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-11-17 00:43:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:43:17,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:17,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:43:17,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -916659886, now seen corresponding path program 1 times [2024-11-17 00:43:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67740102] [2024-11-17 00:43:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:17,889 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:43:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67740102] [2024-11-17 00:43:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67740102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:43:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569675216] [2024-11-17 00:43:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:17,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:43:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:43:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:43:17,891 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:43:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:17,996 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2024-11-17 00:43:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:43:17,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 18 [2024-11-17 00:43:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:17,998 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:43:17,998 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:43:17,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:43:17,999 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 100 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:17,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 208 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:43:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:43:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2024-11-17 00:43:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 144 states have internal predecessors, (158), 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:43:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2024-11-17 00:43:18,003 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 18 [2024-11-17 00:43:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:18,004 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2024-11-17 00:43:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:43:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2024-11-17 00:43:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:43:18,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:18,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, 1, 1] [2024-11-17 00:43:18,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:43:18,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:18,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1630466157, now seen corresponding path program 1 times [2024-11-17 00:43:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:18,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551900974] [2024-11-17 00:43:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:18,128 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:43:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551900974] [2024-11-17 00:43:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551900974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:43:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919188592] [2024-11-17 00:43:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:43:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:43:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:43:18,131 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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:43:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:18,328 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2024-11-17 00:43:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:43:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:43:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:18,329 INFO L225 Difference]: With dead ends: 162 [2024-11-17 00:43:18,330 INFO L226 Difference]: Without dead ends: 162 [2024-11-17 00:43:18,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:43:18,330 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 12 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:18,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 326 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-17 00:43:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2024-11-17 00:43:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 156 states have internal predecessors, (173), 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:43:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2024-11-17 00:43:18,336 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 21 [2024-11-17 00:43:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:18,337 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2024-11-17 00:43:18,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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:43:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2024-11-17 00:43:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:43:18,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:18,338 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:43:18,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:43:18,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:18,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1639092823, now seen corresponding path program 1 times [2024-11-17 00:43:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970315586] [2024-11-17 00:43:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:18,497 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:43:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970315586] [2024-11-17 00:43:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970315586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:43:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803374748] [2024-11-17 00:43:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:43:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:43:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:43:18,501 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:43:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:18,711 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2024-11-17 00:43:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:43:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:43:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:18,712 INFO L225 Difference]: With dead ends: 158 [2024-11-17 00:43:18,712 INFO L226 Difference]: Without dead ends: 158 [2024-11-17 00:43:18,713 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:43:18,713 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:18,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 265 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-17 00:43:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2024-11-17 00:43:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 155 states have internal predecessors, (172), 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:43:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2024-11-17 00:43:18,717 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 24 [2024-11-17 00:43:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:18,718 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2024-11-17 00:43:18,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:43:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2024-11-17 00:43:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:43:18,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:18,718 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:43:18,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:43:18,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:18,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1639092822, now seen corresponding path program 1 times [2024-11-17 00:43:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128372691] [2024-11-17 00:43:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:18,880 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:43:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128372691] [2024-11-17 00:43:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128372691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:43:18,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:43:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:43:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520628766] [2024-11-17 00:43:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:43:18,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:43:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:43:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:43:18,884 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:43:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:19,058 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2024-11-17 00:43:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:43:19,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:43:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:19,062 INFO L225 Difference]: With dead ends: 155 [2024-11-17 00:43:19,062 INFO L226 Difference]: Without dead ends: 155 [2024-11-17 00:43:19,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:43:19,063 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:19,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 346 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:43:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-17 00:43:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-17 00:43:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 153 states have internal predecessors, (170), 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:43:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2024-11-17 00:43:19,068 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 24 [2024-11-17 00:43:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:19,068 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2024-11-17 00:43:19,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:43:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2024-11-17 00:43:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:43:19,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:19,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:19,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:43:19,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash -460345919, now seen corresponding path program 1 times [2024-11-17 00:43:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:19,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63844359] [2024-11-17 00:43:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:19,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63844359] [2024-11-17 00:43:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63844359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:43:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896193363] [2024-11-17 00:43:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:43:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:43:19,367 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:43:19,368 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:43:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:19,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 00:43:19,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:43:19,521 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:43:19,612 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:43:19,612 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:43:19,662 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:43:19,793 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:43:19,794 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:43:19,840 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:43:19,841 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 34 treesize of output 33 [2024-11-17 00:43:19,996 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 25 treesize of output 13 [2024-11-17 00:43:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:20,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:43:20,222 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-17 00:43:20,222 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 19 treesize of output 18 [2024-11-17 00:43:20,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:20,424 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 18 treesize of output 19 [2024-11-17 00:43:20,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:20,436 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 30 treesize of output 33 [2024-11-17 00:43:20,444 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 9 treesize of output 7 [2024-11-17 00:43:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896193363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:43:20,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:43:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2024-11-17 00:43:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715387134] [2024-11-17 00:43:20,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:43:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-17 00:43:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-17 00:43:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=830, Unknown=6, NotChecked=0, Total=930 [2024-11-17 00:43:20,737 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 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:43:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:22,031 INFO L93 Difference]: Finished difference Result 224 states and 253 transitions. [2024-11-17 00:43:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:43:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 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 28 [2024-11-17 00:43:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:22,033 INFO L225 Difference]: With dead ends: 224 [2024-11-17 00:43:22,033 INFO L226 Difference]: Without dead ends: 224 [2024-11-17 00:43:22,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=1282, Unknown=6, NotChecked=0, Total=1482 [2024-11-17 00:43:22,034 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 467 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:22,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1042 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 00:43:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-17 00:43:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 176. [2024-11-17 00:43:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 174 states have internal predecessors, (195), 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:43:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2024-11-17 00:43:22,039 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 28 [2024-11-17 00:43:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:22,039 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2024-11-17 00:43:22,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 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:43:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2024-11-17 00:43:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:43:22,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:22,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:22,061 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:43:22,244 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,SelfDestructingSolverStorable11 [2024-11-17 00:43:22,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:22,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash -460345918, now seen corresponding path program 1 times [2024-11-17 00:43:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:22,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388175718] [2024-11-17 00:43:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388175718] [2024-11-17 00:43:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388175718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:43:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490262368] [2024-11-17 00:43:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:22,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:43:22,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:43:22,709 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:43:22,710 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:43:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:22,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-17 00:43:22,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:43:22,820 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:43:22,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:43:22,901 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:43:22,901 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:43:22,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:43:22,955 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:43:23,119 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:43:23,119 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 16 treesize of output 15 [2024-11-17 00:43:23,135 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:43:23,136 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 33 treesize of output 24 [2024-11-17 00:43:23,180 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:43:23,181 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 50 treesize of output 45 [2024-11-17 00:43:23,189 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 24 treesize of output 11 [2024-11-17 00:43:23,364 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 25 treesize of output 13 [2024-11-17 00:43:23,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-17 00:43:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:23,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:43:23,848 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))))) (forall ((v_ArrVal_333 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 1))))) is different from false [2024-11-17 00:43:23,878 WARN L851 $PredicateComparison]: unable to prove that (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|))) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_333) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_332) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) (forall ((v_ArrVal_333 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_78|) (< |v_ULTIMATE.start_main_~x~0#1.offset_78| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_333) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78|) 1)))))) is different from false [2024-11-17 00:43:23,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:23,919 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 20 treesize of output 21 [2024-11-17 00:43:23,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:23,930 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 34 treesize of output 37 [2024-11-17 00:43:23,937 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 9 treesize of output 7 [2024-11-17 00:43:23,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:23,980 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 37 treesize of output 38 [2024-11-17 00:43:23,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:23,988 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 29 treesize of output 30 [2024-11-17 00:43:23,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:43:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:43:24,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:43:24,000 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-17 00:43:24,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:43:24,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:43:24,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:43:24,010 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-17 00:43:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490262368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:43:24,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:43:24,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2024-11-17 00:43:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713810616] [2024-11-17 00:43:24,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:43:24,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-17 00:43:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-17 00:43:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=7, NotChecked=122, Total=1122 [2024-11-17 00:43:24,242 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 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:43:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:25,760 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2024-11-17 00:43:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:43:25,760 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 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 28 [2024-11-17 00:43:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:25,761 INFO L225 Difference]: With dead ends: 259 [2024-11-17 00:43:25,762 INFO L226 Difference]: Without dead ends: 259 [2024-11-17 00:43:25,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=330, Invalid=1927, Unknown=7, NotChecked=186, Total=2450 [2024-11-17 00:43:25,763 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 651 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:25,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1292 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1715 Invalid, 0 Unknown, 439 Unchecked, 1.0s Time] [2024-11-17 00:43:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-17 00:43:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 179. [2024-11-17 00:43:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 177 states have internal predecessors, (203), 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:43:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2024-11-17 00:43:25,768 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 28 [2024-11-17 00:43:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2024-11-17 00:43:25,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 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:43:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2024-11-17 00:43:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:43:25,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:25,769 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:25,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:43:25,970 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,SelfDestructingSolverStorable12 [2024-11-17 00:43:25,970 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:25,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1432448050, now seen corresponding path program 1 times [2024-11-17 00:43:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:25,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290365020] [2024-11-17 00:43:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:26,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:26,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290365020] [2024-11-17 00:43:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290365020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:43:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403378480] [2024-11-17 00:43:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:26,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:43:26,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:43:26,289 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:43:26,291 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:43:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:26,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:43:26,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:43:26,407 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:43:26,481 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:43:26,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:43:26,532 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:43:26,653 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:43:26,653 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 33 treesize of output 24 [2024-11-17 00:43:26,679 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:43:26,679 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 34 treesize of output 33 [2024-11-17 00:43:26,837 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 33 treesize of output 17 [2024-11-17 00:43:26,861 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 25 treesize of output 13 [2024-11-17 00:43:26,888 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:43:26,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:43:27,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:27,130 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 20 treesize of output 21 [2024-11-17 00:43:27,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:27,141 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 34 treesize of output 37 [2024-11-17 00:43:27,147 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 11 treesize of output 9 [2024-11-17 00:43:27,675 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:43:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403378480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:43:27,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:43:27,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2024-11-17 00:43:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290805616] [2024-11-17 00:43:27,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:43:27,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:43:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:27,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:43:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=686, Unknown=7, NotChecked=0, Total=812 [2024-11-17 00:43:27,678 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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:43:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:28,249 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2024-11-17 00:43:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:43:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 00:43:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:28,252 INFO L225 Difference]: With dead ends: 239 [2024-11-17 00:43:28,252 INFO L226 Difference]: Without dead ends: 239 [2024-11-17 00:43:28,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=734, Unknown=7, NotChecked=0, Total=870 [2024-11-17 00:43:28,253 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 382 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:28,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 807 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:43:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-17 00:43:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 187. [2024-11-17 00:43:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 160 states have (on average 1.33125) internal successors, (213), 185 states have internal predecessors, (213), 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:43:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 216 transitions. [2024-11-17 00:43:28,262 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 216 transitions. Word has length 29 [2024-11-17 00:43:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:28,262 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 216 transitions. [2024-11-17 00:43:28,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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:43:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 216 transitions. [2024-11-17 00:43:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:43:28,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:28,263 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:28,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:43:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:43:28,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:28,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1432448049, now seen corresponding path program 1 times [2024-11-17 00:43:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118561171] [2024-11-17 00:43:28,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:28,864 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:43:28,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118561171] [2024-11-17 00:43:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118561171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:43:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946736391] [2024-11-17 00:43:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:43:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:43:28,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:43:28,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:43:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:28,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-17 00:43:28,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:43:28,970 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:43:29,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:43:29,034 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:43:29,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-17 00:43:29,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:43:29,084 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:43:29,204 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:43:29,205 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 33 treesize of output 24 [2024-11-17 00:43:29,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:43:29,215 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:43:29,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:43:29,235 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 50 treesize of output 45 [2024-11-17 00:43:29,240 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 24 treesize of output 11 [2024-11-17 00:43:29,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:43:29,414 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 33 treesize of output 17 [2024-11-17 00:43:29,432 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 25 treesize of output 13 [2024-11-17 00:43:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-17 00:43:29,451 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:43:29,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:43:29,666 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_ArrVal_508 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (< |v_ULTIMATE.start_main_~x~0#1.offset_90| 0) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (< |v_ULTIMATE.start_main_~x~0#1.offset_90| 0) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|)))))) is different from false [2024-11-17 00:43:29,703 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_90| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_ArrVal_508 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_90|) (< |v_ULTIMATE.start_main_~x~0#1.offset_90| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_508) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90|) 5))))) is different from false [2024-11-17 00:43:29,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:29,797 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 37 treesize of output 38 [2024-11-17 00:43:29,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:29,805 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 29 treesize of output 30 [2024-11-17 00:43:29,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:29,815 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 52 treesize of output 55 [2024-11-17 00:43:29,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:29,830 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 82 treesize of output 81 [2024-11-17 00:43:29,839 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 15 treesize of output 13 [2024-11-17 00:43:29,845 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 13 treesize of output 11 [2024-11-17 00:43:29,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:29,896 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 20 treesize of output 21 [2024-11-17 00:43:29,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:43:29,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:43:29,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:43:29,904 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 00:43:30,119 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:43:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946736391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:43:30,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:43:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2024-11-17 00:43:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941786412] [2024-11-17 00:43:30,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:43:30,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-17 00:43:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:43:30,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-17 00:43:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=8, NotChecked=110, Total=930 [2024-11-17 00:43:30,122 INFO L87 Difference]: Start difference. First operand 187 states and 216 transitions. Second operand has 31 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:43:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:43:31,032 INFO L93 Difference]: Finished difference Result 244 states and 279 transitions. [2024-11-17 00:43:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:43:31,032 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 00:43:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:43:31,033 INFO L225 Difference]: With dead ends: 244 [2024-11-17 00:43:31,033 INFO L226 Difference]: Without dead ends: 244 [2024-11-17 00:43:31,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=1082, Unknown=8, NotChecked=138, Total=1406 [2024-11-17 00:43:31,034 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 399 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:43:31,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 877 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1052 Invalid, 0 Unknown, 348 Unchecked, 0.6s Time] [2024-11-17 00:43:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-17 00:43:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 187. [2024-11-17 00:43:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 160 states have (on average 1.325) internal successors, (212), 185 states have internal predecessors, (212), 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:43:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 215 transitions. [2024-11-17 00:43:31,039 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 215 transitions. Word has length 29 [2024-11-17 00:43:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:43:31,039 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 215 transitions. [2024-11-17 00:43:31,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:43:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 215 transitions. [2024-11-17 00:43:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 00:43:31,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:43:31,040 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:43:31,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:43:31,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-17 00:43:31,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 52 more)] === [2024-11-17 00:43:31,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:43:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2098891993, now seen corresponding path program 1 times [2024-11-17 00:43:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:43:31,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518261941] [2024-11-17 00:43:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:43:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:43:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518261941] [2024-11-17 00:43:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518261941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:43:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456161982] [2024-11-17 00:43:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:43:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:43:31,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:43:31,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:43:31,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:43:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:43:31,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:43:31,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:43:31,825 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:43:31,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:43:31,873 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:43:32,023 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-17 00:43:32,024 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 33 treesize of output 24 [2024-11-17 00:43:32,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:43:32,055 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 34 treesize of output 33 [2024-11-17 00:43:32,147 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 25 treesize of output 13 [2024-11-17 00:43:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:43:32,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:43:32,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:32,444 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 20 treesize of output 21 [2024-11-17 00:43:32,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:32,451 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 34 treesize of output 37 [2024-11-17 00:43:32,462 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 11 treesize of output 9 [2024-11-17 00:43:34,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:43:34,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 225 treesize of output 1413