./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:58:38,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:58:38,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:58:38,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:58:38,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:58:38,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:58:38,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:58:38,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:58:38,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:58:38,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:58:38,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:58:38,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:58:38,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:58:38,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:58:38,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:58:38,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:58:38,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:58:38,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:58:38,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:58:38,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:58:38,949 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:58:38,952 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:58:38,952 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:58:38,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:58:38,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:58:38,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:58:38,953 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:58:38,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:58:38,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:58:38,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:58:38,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:58:38,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:58:38,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:58:38,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:58:38,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:58:38,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:58:38,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:58:38,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:58:38,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:58:38,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:58:38,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:58:38,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:58:38,959 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2024-11-09 07:58:39,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:58:39,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:58:39,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:58:39,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:58:39,267 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:58:39,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2024-11-09 07:58:40,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:58:40,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:58:40,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2024-11-09 07:58:40,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adfb17b4d/f3707d1733f34125bb2e4717911bf1c9/FLAGe6f8e671e [2024-11-09 07:58:41,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adfb17b4d/f3707d1733f34125bb2e4717911bf1c9 [2024-11-09 07:58:41,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:58:41,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:58:41,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:58:41,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:58:41,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:58:41,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1808beb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41, skipping insertion in model container [2024-11-09 07:58:41,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:58:41,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:58:41,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:58:41,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:58:41,743 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:58:41,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41 WrapperNode [2024-11-09 07:58:41,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:58:41,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:58:41,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:58:41,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:58:41,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,799 INFO L138 Inliner]: procedures = 119, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 230 [2024-11-09 07:58:41,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:58:41,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:58:41,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:58:41,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:58:41,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,849 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-09 07:58:41,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:58:41,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:58:41,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:58:41,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:58:41,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (1/1) ... [2024-11-09 07:58:41,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:58:41,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:41,919 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-09 07:58:41,926 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-09 07:58:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:58:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:58:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:58:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:58:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:58:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:58:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:58:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:58:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:58:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:58:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:58:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:58:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:58:42,088 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:58:42,090 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:58:42,583 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-11-09 07:58:42,584 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:58:42,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:58:42,610 INFO L316 CfgBuilder]: Removed 30 assume(true) statements. [2024-11-09 07:58:42,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:58:42 BoogieIcfgContainer [2024-11-09 07:58:42,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:58:42,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:58:42,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:58:42,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:58:42,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:58:41" (1/3) ... [2024-11-09 07:58:42,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c69cd68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:58:42, skipping insertion in model container [2024-11-09 07:58:42,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:58:41" (2/3) ... [2024-11-09 07:58:42,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c69cd68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:58:42, skipping insertion in model container [2024-11-09 07:58:42,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:58:42" (3/3) ... [2024-11-09 07:58:42,619 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2024-11-09 07:58:42,633 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:58:42,633 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2024-11-09 07:58:42,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:58:42,691 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;@1bb62228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:58:42,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2024-11-09 07:58:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 114 states have (on average 2.0526315789473686) internal successors, (234), 180 states have internal predecessors, (234), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:58:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:58:42,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:42,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:58:42,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:42,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-09 07:58:42,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:42,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263591882] [2024-11-09 07:58:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:42,989 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-09 07:58:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263591882] [2024-11-09 07:58:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263591882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:42,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:42,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:58:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606478743] [2024-11-09 07:58:42,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:43,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:43,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:43,033 INFO L87 Difference]: Start difference. First operand has 195 states, 114 states have (on average 2.0526315789473686) internal successors, (234), 180 states have internal predecessors, (234), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:43,253 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2024-11-09 07:58:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:43,256 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-09 07:58:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:43,266 INFO L225 Difference]: With dead ends: 175 [2024-11-09 07:58:43,266 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 07:58:43,268 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-09 07:58:43,272 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 154 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:43,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 125 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 07:58:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-09 07:58:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 102 states have (on average 1.803921568627451) internal successors, (184), 171 states have internal predecessors, (184), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 197 transitions. [2024-11-09 07:58:43,318 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 197 transitions. Word has length 3 [2024-11-09 07:58:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:43,319 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 197 transitions. [2024-11-09 07:58:43,319 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-09 07:58:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 197 transitions. [2024-11-09 07:58:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:58:43,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:43,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:58:43,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:58:43,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:43,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-09 07:58:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725399259] [2024-11-09 07:58:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:43,460 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-09 07:58:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725399259] [2024-11-09 07:58:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725399259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:43,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:43,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:58:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639504751] [2024-11-09 07:58:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:43,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:43,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:43,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:43,465 INFO L87 Difference]: Start difference. First operand 173 states and 197 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-09 07:58:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:43,646 INFO L93 Difference]: Finished difference Result 193 states and 221 transitions. [2024-11-09 07:58:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:43,647 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-09 07:58:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:43,648 INFO L225 Difference]: With dead ends: 193 [2024-11-09 07:58:43,649 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 07:58:43,650 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-09 07:58:43,651 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 152 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:43,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 07:58:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 183. [2024-11-09 07:58:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 119 states have (on average 1.7226890756302522) internal successors, (205), 181 states have internal predecessors, (205), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 218 transitions. [2024-11-09 07:58:43,671 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 218 transitions. Word has length 3 [2024-11-09 07:58:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:43,671 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 218 transitions. [2024-11-09 07:58:43,672 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-09 07:58:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 218 transitions. [2024-11-09 07:58:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:58:43,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:43,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:58:43,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:43,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1467435379, now seen corresponding path program 1 times [2024-11-09 07:58:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557400110] [2024-11-09 07:58:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:43,744 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-09 07:58:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557400110] [2024-11-09 07:58:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557400110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935650315] [2024-11-09 07:58:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:43,749 INFO L87 Difference]: Start difference. First operand 183 states and 218 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:43,797 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2024-11-09 07:58:43,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:43,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:58:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:43,799 INFO L225 Difference]: With dead ends: 194 [2024-11-09 07:58:43,799 INFO L226 Difference]: Without dead ends: 194 [2024-11-09 07:58:43,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:43,801 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 155 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:43,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 209 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:58:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-09 07:58:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2024-11-09 07:58:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 119 states have (on average 1.7058823529411764) internal successors, (203), 180 states have internal predecessors, (203), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2024-11-09 07:58:43,827 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 7 [2024-11-09 07:58:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:43,827 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2024-11-09 07:58:43,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2024-11-09 07:58:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:58:43,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:43,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:43,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:58:43,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:43,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1997087996, now seen corresponding path program 1 times [2024-11-09 07:58:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:43,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427814852] [2024-11-09 07:58:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:44,063 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-09 07:58:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427814852] [2024-11-09 07:58:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427814852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420696222] [2024-11-09 07:58:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:44,068 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:44,251 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2024-11-09 07:58:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:44,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:58:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:44,253 INFO L225 Difference]: With dead ends: 181 [2024-11-09 07:58:44,253 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 07:58:44,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:44,255 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 2 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:44,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 526 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:44,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 07:58:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-09 07:58:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 119 states have (on average 1.6974789915966386) internal successors, (202), 179 states have internal predecessors, (202), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2024-11-09 07:58:44,269 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 11 [2024-11-09 07:58:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:44,269 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2024-11-09 07:58:44,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2024-11-09 07:58:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:58:44,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:44,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:44,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:58:44,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:44,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1997087997, now seen corresponding path program 1 times [2024-11-09 07:58:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:44,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389204062] [2024-11-09 07:58:44,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:44,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:44,519 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-09 07:58:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:44,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389204062] [2024-11-09 07:58:44,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389204062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:44,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:44,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:44,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339707475] [2024-11-09 07:58:44,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:44,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:44,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:44,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:44,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:44,524 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:44,706 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2024-11-09 07:58:44,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:44,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:58:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:44,708 INFO L225 Difference]: With dead ends: 180 [2024-11-09 07:58:44,708 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 07:58:44,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:44,709 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:44,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 537 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 07:58:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-09 07:58:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.6890756302521008) internal successors, (201), 178 states have internal predecessors, (201), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 213 transitions. [2024-11-09 07:58:44,723 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 213 transitions. Word has length 11 [2024-11-09 07:58:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:44,724 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 213 transitions. [2024-11-09 07:58:44,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 213 transitions. [2024-11-09 07:58:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:58:44,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:44,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:44,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:58:44,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:44,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1031698178, now seen corresponding path program 1 times [2024-11-09 07:58:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068580593] [2024-11-09 07:58:44,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:44,768 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-09 07:58:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:44,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068580593] [2024-11-09 07:58:44,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068580593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:44,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803911715] [2024-11-09 07:58:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:44,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:44,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:44,775 INFO L87 Difference]: Start difference. First operand 180 states and 213 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:44,786 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2024-11-09 07:58:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:44,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:58:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:44,787 INFO L225 Difference]: With dead ends: 181 [2024-11-09 07:58:44,787 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 07:58:44,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:44,788 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:44,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:58:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 07:58:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-09 07:58:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.6833333333333333) internal successors, (202), 179 states have internal predecessors, (202), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2024-11-09 07:58:44,799 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 15 [2024-11-09 07:58:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:44,800 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2024-11-09 07:58:44,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2024-11-09 07:58:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:58:44,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:44,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:44,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:58:44,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1361526525, now seen corresponding path program 1 times [2024-11-09 07:58:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829031374] [2024-11-09 07:58:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:45,071 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-09 07:58:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:45,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829031374] [2024-11-09 07:58:45,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829031374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:45,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:45,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:58:45,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333431861] [2024-11-09 07:58:45,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:45,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:58:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:58:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:58:45,074 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:45,412 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2024-11-09 07:58:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:58:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:58:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:45,413 INFO L225 Difference]: With dead ends: 180 [2024-11-09 07:58:45,414 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 07:58:45,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:58:45,415 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 152 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:45,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 510 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 07:58:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-09 07:58:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 120 states have (on average 1.675) internal successors, (201), 178 states have internal predecessors, (201), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 213 transitions. [2024-11-09 07:58:45,420 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 213 transitions. Word has length 14 [2024-11-09 07:58:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:45,420 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 213 transitions. [2024-11-09 07:58:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 213 transitions. [2024-11-09 07:58:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:58:45,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:45,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:58:45,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1361526526, now seen corresponding path program 1 times [2024-11-09 07:58:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86390827] [2024-11-09 07:58:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:45,719 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-09 07:58:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86390827] [2024-11-09 07:58:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86390827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:58:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297885754] [2024-11-09 07:58:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:45,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:58:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:58:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:58:45,721 INFO L87 Difference]: Start difference. First operand 180 states and 213 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:46,068 INFO L93 Difference]: Finished difference Result 179 states and 212 transitions. [2024-11-09 07:58:46,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:58:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:58:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:46,071 INFO L225 Difference]: With dead ends: 179 [2024-11-09 07:58:46,071 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 07:58:46,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:58:46,072 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 149 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:46,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 401 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 07:58:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-09 07:58:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.6666666666666667) internal successors, (200), 177 states have internal predecessors, (200), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 212 transitions. [2024-11-09 07:58:46,078 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 212 transitions. Word has length 14 [2024-11-09 07:58:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:46,078 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 212 transitions. [2024-11-09 07:58:46,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 212 transitions. [2024-11-09 07:58:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:58:46,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:46,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:46,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:58:46,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:46,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1909209027, now seen corresponding path program 1 times [2024-11-09 07:58:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:46,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548581350] [2024-11-09 07:58:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:46,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:46,214 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-09 07:58:46,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:46,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548581350] [2024-11-09 07:58:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548581350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:46,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:46,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:58:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568837408] [2024-11-09 07:58:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:58:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:58:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:58:46,219 INFO L87 Difference]: Start difference. First operand 179 states and 212 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:46,411 INFO L93 Difference]: Finished difference Result 255 states and 302 transitions. [2024-11-09 07:58:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:58:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:58:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:46,415 INFO L225 Difference]: With dead ends: 255 [2024-11-09 07:58:46,415 INFO L226 Difference]: Without dead ends: 255 [2024-11-09 07:58:46,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:58:46,416 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 158 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:46,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 704 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-09 07:58:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 177. [2024-11-09 07:58:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 119 states have (on average 1.6638655462184875) internal successors, (198), 175 states have internal predecessors, (198), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 209 transitions. [2024-11-09 07:58:46,421 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 209 transitions. Word has length 17 [2024-11-09 07:58:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:46,421 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 209 transitions. [2024-11-09 07:58:46,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 209 transitions. [2024-11-09 07:58:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:58:46,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:46,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:58:46,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:46,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash 460258648, now seen corresponding path program 1 times [2024-11-09 07:58:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:46,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387301562] [2024-11-09 07:58:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:46,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:46,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387301562] [2024-11-09 07:58:46,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387301562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:46,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:58:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028795545] [2024-11-09 07:58:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:46,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:46,537 INFO L87 Difference]: Start difference. First operand 177 states and 209 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:46,665 INFO L93 Difference]: Finished difference Result 256 states and 302 transitions. [2024-11-09 07:58:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:46,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:58:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:46,670 INFO L225 Difference]: With dead ends: 256 [2024-11-09 07:58:46,670 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 07:58:46,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:58:46,671 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 81 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:46,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 589 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 07:58:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 180. [2024-11-09 07:58:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 178 states have internal predecessors, (201), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 212 transitions. [2024-11-09 07:58:46,680 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 212 transitions. Word has length 17 [2024-11-09 07:58:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:46,681 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 212 transitions. [2024-11-09 07:58:46,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 212 transitions. [2024-11-09 07:58:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:58:46,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:46,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:46,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:58:46,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:46,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 583601885, now seen corresponding path program 1 times [2024-11-09 07:58:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:46,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100361221] [2024-11-09 07:58:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:46,778 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-09 07:58:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100361221] [2024-11-09 07:58:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100361221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731647783] [2024-11-09 07:58:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:46,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:58:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:58:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:58:46,781 INFO L87 Difference]: Start difference. First operand 180 states and 212 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:46,944 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2024-11-09 07:58:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:58:46,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:58:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:46,946 INFO L225 Difference]: With dead ends: 171 [2024-11-09 07:58:46,946 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 07:58:46,946 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-09 07:58:46,947 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 203 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:46,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 118 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 07:58:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-09 07:58:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 124 states have (on average 1.5483870967741935) internal successors, (192), 169 states have internal predecessors, (192), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 203 transitions. [2024-11-09 07:58:46,951 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 203 transitions. Word has length 19 [2024-11-09 07:58:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:46,951 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 203 transitions. [2024-11-09 07:58:46,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2024-11-09 07:58:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:58:46,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:46,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:46,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:58:46,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash 583601886, now seen corresponding path program 1 times [2024-11-09 07:58:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:46,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041663382] [2024-11-09 07:58:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:47,059 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-09 07:58:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041663382] [2024-11-09 07:58:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041663382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763817231] [2024-11-09 07:58:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:47,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:58:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:58:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:58:47,061 INFO L87 Difference]: Start difference. First operand 171 states and 203 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:47,248 INFO L93 Difference]: Finished difference Result 211 states and 244 transitions. [2024-11-09 07:58:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:58:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:58:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:47,250 INFO L225 Difference]: With dead ends: 211 [2024-11-09 07:58:47,250 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 07:58:47,250 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-09 07:58:47,251 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 194 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:47,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 196 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 07:58:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2024-11-09 07:58:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 190 states have internal predecessors, (225), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 236 transitions. [2024-11-09 07:58:47,256 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 236 transitions. Word has length 19 [2024-11-09 07:58:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:47,256 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 236 transitions. [2024-11-09 07:58:47,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 236 transitions. [2024-11-09 07:58:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:58:47,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:47,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:58:47,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:47,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1788857113, now seen corresponding path program 1 times [2024-11-09 07:58:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308186393] [2024-11-09 07:58:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:47,293 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-09 07:58:47,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:47,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308186393] [2024-11-09 07:58:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308186393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:47,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233490028] [2024-11-09 07:58:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:47,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:58:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:58:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:58:47,296 INFO L87 Difference]: Start difference. First operand 192 states and 236 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:47,392 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2024-11-09 07:58:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:58:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:58:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:47,394 INFO L225 Difference]: With dead ends: 212 [2024-11-09 07:58:47,394 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 07:58:47,394 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-09 07:58:47,395 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 194 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:47,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 277 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 07:58:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2024-11-09 07:58:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 189 states have internal predecessors, (223), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 233 transitions. [2024-11-09 07:58:47,402 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 233 transitions. Word has length 23 [2024-11-09 07:58:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:47,402 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 233 transitions. [2024-11-09 07:58:47,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 233 transitions. [2024-11-09 07:58:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:58:47,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:47,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:47,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:58:47,404 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:47,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1742737311, now seen corresponding path program 1 times [2024-11-09 07:58:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536751415] [2024-11-09 07:58:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:47,507 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-09 07:58:47,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536751415] [2024-11-09 07:58:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536751415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:58:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277619725] [2024-11-09 07:58:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:47,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:58:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:47,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:58:47,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:47,509 INFO L87 Difference]: Start difference. First operand 191 states and 233 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:47,725 INFO L93 Difference]: Finished difference Result 191 states and 233 transitions. [2024-11-09 07:58:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:58:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:58:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:47,727 INFO L225 Difference]: With dead ends: 191 [2024-11-09 07:58:47,727 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 07:58:47,727 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-09 07:58:47,727 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:47,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 410 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 07:58:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2024-11-09 07:58:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 188 states have internal predecessors, (222), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 232 transitions. [2024-11-09 07:58:47,732 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 232 transitions. Word has length 23 [2024-11-09 07:58:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:47,732 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 232 transitions. [2024-11-09 07:58:47,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2024-11-09 07:58:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:58:47,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:47,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:58:47,734 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1742737312, now seen corresponding path program 1 times [2024-11-09 07:58:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617964009] [2024-11-09 07:58:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:47,885 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-09 07:58:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617964009] [2024-11-09 07:58:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617964009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:58:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455717614] [2024-11-09 07:58:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:47,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:58:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:47,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:58:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:47,886 INFO L87 Difference]: Start difference. First operand 190 states and 232 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:48,109 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2024-11-09 07:58:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:58:48,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:58:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:48,113 INFO L225 Difference]: With dead ends: 182 [2024-11-09 07:58:48,114 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 07:58:48,114 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-09 07:58:48,114 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 35 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:48,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 489 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:58:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 07:58:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2024-11-09 07:58:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 174 states have internal predecessors, (207), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 217 transitions. [2024-11-09 07:58:48,121 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 217 transitions. Word has length 23 [2024-11-09 07:58:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:48,122 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 217 transitions. [2024-11-09 07:58:48,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 217 transitions. [2024-11-09 07:58:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:58:48,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:48,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:48,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:58:48,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:48,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1412415177, now seen corresponding path program 1 times [2024-11-09 07:58:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599394898] [2024-11-09 07:58:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:48,221 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-09 07:58:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599394898] [2024-11-09 07:58:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599394898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:58:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416311211] [2024-11-09 07:58:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:58:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:58:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:48,224 INFO L87 Difference]: Start difference. First operand 176 states and 217 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:48,346 INFO L93 Difference]: Finished difference Result 180 states and 220 transitions. [2024-11-09 07:58:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:58:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 07:58:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:48,348 INFO L225 Difference]: With dead ends: 180 [2024-11-09 07:58:48,348 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 07:58:48,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:58:48,349 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 34 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:48,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 603 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 07:58:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2024-11-09 07:58:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.4642857142857142) internal successors, (205), 172 states have internal predecessors, (205), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 213 transitions. [2024-11-09 07:58:48,353 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 213 transitions. Word has length 27 [2024-11-09 07:58:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:48,353 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 213 transitions. [2024-11-09 07:58:48,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 213 transitions. [2024-11-09 07:58:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:58:48,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:48,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:48,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:58:48,355 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:48,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1770020065, now seen corresponding path program 1 times [2024-11-09 07:58:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:48,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428384387] [2024-11-09 07:58:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:48,383 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-09 07:58:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:48,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428384387] [2024-11-09 07:58:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428384387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:48,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:48,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81765071] [2024-11-09 07:58:48,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:48,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:48,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:48,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:48,385 INFO L87 Difference]: Start difference. First operand 174 states and 213 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:48,395 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2024-11-09 07:58:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:48,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:58:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:48,397 INFO L225 Difference]: With dead ends: 186 [2024-11-09 07:58:48,397 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 07:58:48,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:48,398 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 7 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:48,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 285 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:58:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 07:58:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 180. [2024-11-09 07:58:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.4589041095890412) internal successors, (213), 178 states have internal predecessors, (213), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2024-11-09 07:58:48,402 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 29 [2024-11-09 07:58:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:48,402 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2024-11-09 07:58:48,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2024-11-09 07:58:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:58:48,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:48,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:48,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:58:48,404 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash -978770518, now seen corresponding path program 1 times [2024-11-09 07:58:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785454528] [2024-11-09 07:58:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:48,436 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-09 07:58:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785454528] [2024-11-09 07:58:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785454528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744693585] [2024-11-09 07:58:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:48,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:48,439 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:48,484 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2024-11-09 07:58:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:48,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 07:58:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:48,486 INFO L225 Difference]: With dead ends: 179 [2024-11-09 07:58:48,486 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 07:58:48,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:48,487 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:48,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 259 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:58:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 07:58:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-09 07:58:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 177 states have internal predecessors, (211), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2024-11-09 07:58:48,490 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 218 transitions. Word has length 30 [2024-11-09 07:58:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:48,491 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 218 transitions. [2024-11-09 07:58:48,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 218 transitions. [2024-11-09 07:58:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:58:48,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:48,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:48,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:58:48,492 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:48,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1769540364, now seen corresponding path program 1 times [2024-11-09 07:58:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095609401] [2024-11-09 07:58:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:48,645 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-09 07:58:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:48,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095609401] [2024-11-09 07:58:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095609401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:48,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:48,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:58:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433196349] [2024-11-09 07:58:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:48,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:58:48,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:48,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:58:48,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:58:48,648 INFO L87 Difference]: Start difference. First operand 179 states and 218 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:48,975 INFO L93 Difference]: Finished difference Result 270 states and 325 transitions. [2024-11-09 07:58:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:58:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:58:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:48,976 INFO L225 Difference]: With dead ends: 270 [2024-11-09 07:58:48,976 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 07:58:48,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:58:48,977 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 95 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:48,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 823 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 07:58:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 191. [2024-11-09 07:58:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 158 states have (on average 1.4177215189873418) internal successors, (224), 189 states have internal predecessors, (224), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2024-11-09 07:58:48,982 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 29 [2024-11-09 07:58:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:48,982 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2024-11-09 07:58:48,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2024-11-09 07:58:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:58:48,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:48,983 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:48,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:58:48,983 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:48,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 186972800, now seen corresponding path program 1 times [2024-11-09 07:58:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:48,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685032600] [2024-11-09 07:58:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:49,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:49,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685032600] [2024-11-09 07:58:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685032600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630149404] [2024-11-09 07:58:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:49,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:49,144 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-09 07:58:49,146 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-09 07:58:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:49,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:58:49,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:49,316 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-09 07:58:49,327 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-09 07:58:49,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:58:49,401 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-09 07:58:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:49,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:58:50,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:58:50,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-09 07:58:50,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:58:50,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:58:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630149404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:58:50,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:58:50,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-09 07:58:50,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427815840] [2024-11-09 07:58:50,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:58:50,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:58:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:50,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:58:50,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:58:50,173 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:50,665 INFO L93 Difference]: Finished difference Result 312 states and 364 transitions. [2024-11-09 07:58:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:58:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 07:58:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:50,667 INFO L225 Difference]: With dead ends: 312 [2024-11-09 07:58:50,668 INFO L226 Difference]: Without dead ends: 312 [2024-11-09 07:58:50,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:58:50,669 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 546 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:50,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 741 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-09 07:58:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 219. [2024-11-09 07:58:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 186 states have (on average 1.424731182795699) internal successors, (265), 217 states have internal predecessors, (265), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 272 transitions. [2024-11-09 07:58:50,675 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 272 transitions. Word has length 31 [2024-11-09 07:58:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:50,675 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 272 transitions. [2024-11-09 07:58:50,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2024-11-09 07:58:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:58:50,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:50,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:50,696 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-09 07:58:50,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:50,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:50,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash -527258123, now seen corresponding path program 1 times [2024-11-09 07:58:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754293559] [2024-11-09 07:58:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:50,976 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-09 07:58:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754293559] [2024-11-09 07:58:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754293559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:50,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014315999] [2024-11-09 07:58:50,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:50,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:50,979 INFO L87 Difference]: Start difference. First operand 219 states and 272 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:51,130 INFO L93 Difference]: Finished difference Result 218 states and 271 transitions. [2024-11-09 07:58:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:51,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:58:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:51,132 INFO L225 Difference]: With dead ends: 218 [2024-11-09 07:58:51,132 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 07:58:51,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:51,133 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:51,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 416 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 07:58:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-09 07:58:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 186 states have (on average 1.4193548387096775) internal successors, (264), 216 states have internal predecessors, (264), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 271 transitions. [2024-11-09 07:58:51,138 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 271 transitions. Word has length 33 [2024-11-09 07:58:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:51,138 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 271 transitions. [2024-11-09 07:58:51,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 271 transitions. [2024-11-09 07:58:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:58:51,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:51,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:58:51,139 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:51,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash -527258122, now seen corresponding path program 1 times [2024-11-09 07:58:51,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243203763] [2024-11-09 07:58:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:51,292 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-09 07:58:51,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243203763] [2024-11-09 07:58:51,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243203763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:51,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:51,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:58:51,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982912390] [2024-11-09 07:58:51,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:51,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:58:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:58:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:58:51,294 INFO L87 Difference]: Start difference. First operand 218 states and 271 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:51,437 INFO L93 Difference]: Finished difference Result 217 states and 270 transitions. [2024-11-09 07:58:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:58:51,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:58:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:51,438 INFO L225 Difference]: With dead ends: 217 [2024-11-09 07:58:51,438 INFO L226 Difference]: Without dead ends: 217 [2024-11-09 07:58:51,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:58:51,439 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:51,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 419 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-09 07:58:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-09 07:58:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 186 states have (on average 1.413978494623656) internal successors, (263), 215 states have internal predecessors, (263), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 270 transitions. [2024-11-09 07:58:51,444 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 270 transitions. Word has length 33 [2024-11-09 07:58:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 270 transitions. [2024-11-09 07:58:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 270 transitions. [2024-11-09 07:58:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:58:51,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:51,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:51,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:58:51,445 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1005529021, now seen corresponding path program 1 times [2024-11-09 07:58:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111175053] [2024-11-09 07:58:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:51,945 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-09 07:58:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:51,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111175053] [2024-11-09 07:58:51,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111175053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:51,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:51,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:58:51,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761185484] [2024-11-09 07:58:51,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:51,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:58:51,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:58:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:58:51,947 INFO L87 Difference]: Start difference. First operand 217 states and 270 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:52,705 INFO L93 Difference]: Finished difference Result 278 states and 326 transitions. [2024-11-09 07:58:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:58:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 07:58:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:52,707 INFO L225 Difference]: With dead ends: 278 [2024-11-09 07:58:52,707 INFO L226 Difference]: Without dead ends: 278 [2024-11-09 07:58:52,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:58:52,708 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 410 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:52,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 900 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:58:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-09 07:58:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 218. [2024-11-09 07:58:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 189 states have (on average 1.380952380952381) internal successors, (261), 216 states have internal predecessors, (261), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 268 transitions. [2024-11-09 07:58:52,713 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 268 transitions. Word has length 34 [2024-11-09 07:58:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:52,713 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 268 transitions. [2024-11-09 07:58:52,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 268 transitions. [2024-11-09 07:58:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:58:52,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:52,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:52,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:58:52,715 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:52,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1005529022, now seen corresponding path program 1 times [2024-11-09 07:58:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486671735] [2024-11-09 07:58:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:53,221 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-09 07:58:53,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486671735] [2024-11-09 07:58:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486671735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:53,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:53,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:58:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27321024] [2024-11-09 07:58:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:53,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:58:53,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:53,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:58:53,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:58:53,224 INFO L87 Difference]: Start difference. First operand 218 states and 268 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:53,907 INFO L93 Difference]: Finished difference Result 293 states and 340 transitions. [2024-11-09 07:58:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:58:53,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 07:58:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:53,909 INFO L225 Difference]: With dead ends: 293 [2024-11-09 07:58:53,909 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 07:58:53,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:58:53,910 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 286 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:53,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 899 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:58:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 07:58:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 224. [2024-11-09 07:58:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 222 states have internal predecessors, (268), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2024-11-09 07:58:53,916 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 34 [2024-11-09 07:58:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:53,916 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2024-11-09 07:58:53,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2024-11-09 07:58:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:58:53,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:53,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:53,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:58:53,917 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:53,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash -906969335, now seen corresponding path program 1 times [2024-11-09 07:58:53,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:53,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567452498] [2024-11-09 07:58:53,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:53,962 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-09 07:58:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567452498] [2024-11-09 07:58:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567452498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:53,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:58:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793626030] [2024-11-09 07:58:53,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:53,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:53,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:53,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:53,965 INFO L87 Difference]: Start difference. First operand 224 states and 275 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:53,974 INFO L93 Difference]: Finished difference Result 225 states and 276 transitions. [2024-11-09 07:58:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:53,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 07:58:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:53,976 INFO L225 Difference]: With dead ends: 225 [2024-11-09 07:58:53,976 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 07:58:53,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:53,977 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:53,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:58:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 07:58:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-09 07:58:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 196 states have (on average 1.3724489795918366) internal successors, (269), 223 states have internal predecessors, (269), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 276 transitions. [2024-11-09 07:58:53,982 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 276 transitions. Word has length 37 [2024-11-09 07:58:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:53,982 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 276 transitions. [2024-11-09 07:58:53,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 276 transitions. [2024-11-09 07:58:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:58:53,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:53,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:53,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 07:58:53,984 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash -851203752, now seen corresponding path program 1 times [2024-11-09 07:58:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:53,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790771299] [2024-11-09 07:58:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:54,280 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-09 07:58:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790771299] [2024-11-09 07:58:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790771299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:58:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623497486] [2024-11-09 07:58:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:54,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:58:54,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:54,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:58:54,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:58:54,282 INFO L87 Difference]: Start difference. First operand 225 states and 276 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:54,618 INFO L93 Difference]: Finished difference Result 225 states and 276 transitions. [2024-11-09 07:58:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:58:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 07:58:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:54,619 INFO L225 Difference]: With dead ends: 225 [2024-11-09 07:58:54,619 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 07:58:54,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:58:54,620 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 63 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:54,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 627 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 07:58:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2024-11-09 07:58:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 222 states have internal predecessors, (268), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2024-11-09 07:58:54,625 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 36 [2024-11-09 07:58:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:54,625 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2024-11-09 07:58:54,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2024-11-09 07:58:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:58:54,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:54,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:54,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:58:54,627 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:54,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash -851203751, now seen corresponding path program 1 times [2024-11-09 07:58:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:54,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380911880] [2024-11-09 07:58:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:55,030 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-09 07:58:55,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:55,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380911880] [2024-11-09 07:58:55,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380911880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:55,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:55,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:58:55,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226648654] [2024-11-09 07:58:55,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:55,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:58:55,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:55,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:58:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:58:55,033 INFO L87 Difference]: Start difference. First operand 224 states and 275 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:55,464 INFO L93 Difference]: Finished difference Result 224 states and 275 transitions. [2024-11-09 07:58:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:58:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 07:58:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:55,465 INFO L225 Difference]: With dead ends: 224 [2024-11-09 07:58:55,465 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 07:58:55,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:58:55,466 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 59 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:55,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 788 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:58:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 07:58:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2024-11-09 07:58:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 221 states have internal predecessors, (267), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2024-11-09 07:58:55,472 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 36 [2024-11-09 07:58:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:55,472 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2024-11-09 07:58:55,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2024-11-09 07:58:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:58:55,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:55,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:55,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 07:58:55,473 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:55,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 750180583, now seen corresponding path program 1 times [2024-11-09 07:58:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:55,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769010363] [2024-11-09 07:58:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:58:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769010363] [2024-11-09 07:58:55,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769010363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:55,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:55,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:58:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383088172] [2024-11-09 07:58:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:55,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:58:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:58:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:58:55,596 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-09 07:58:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:55,777 INFO L93 Difference]: Finished difference Result 236 states and 287 transitions. [2024-11-09 07:58:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:58:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-09 07:58:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:55,778 INFO L225 Difference]: With dead ends: 236 [2024-11-09 07:58:55,779 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 07:58:55,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:58:55,779 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 16 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:55,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 527 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 07:58:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-09 07:58:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 205 states have (on average 1.3463414634146342) internal successors, (276), 230 states have internal predecessors, (276), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 283 transitions. [2024-11-09 07:58:55,784 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 283 transitions. Word has length 37 [2024-11-09 07:58:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:55,784 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 283 transitions. [2024-11-09 07:58:55,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-09 07:58:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 283 transitions. [2024-11-09 07:58:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:58:55,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:55,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:55,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 07:58:55,785 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:55,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash -589078129, now seen corresponding path program 1 times [2024-11-09 07:58:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:55,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366982813] [2024-11-09 07:58:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:56,596 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-09 07:58:56,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:56,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366982813] [2024-11-09 07:58:56,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366982813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:56,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:58:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680816889] [2024-11-09 07:58:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:56,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:58:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:56,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:58:56,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:58:56,598 INFO L87 Difference]: Start difference. First operand 232 states and 283 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:57,739 INFO L93 Difference]: Finished difference Result 400 states and 468 transitions. [2024-11-09 07:58:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:58:57,739 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 07:58:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:57,741 INFO L225 Difference]: With dead ends: 400 [2024-11-09 07:58:57,741 INFO L226 Difference]: Without dead ends: 400 [2024-11-09 07:58:57,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:58:57,746 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 559 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:57,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1032 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:58:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-09 07:58:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 266. [2024-11-09 07:58:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3221757322175731) internal successors, (316), 264 states have internal predecessors, (316), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 323 transitions. [2024-11-09 07:58:57,755 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 323 transitions. Word has length 38 [2024-11-09 07:58:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:57,756 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 323 transitions. [2024-11-09 07:58:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 323 transitions. [2024-11-09 07:58:57,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:58:57,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:57,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:57,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 07:58:57,757 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:57,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1843498648, now seen corresponding path program 1 times [2024-11-09 07:58:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510455666] [2024-11-09 07:58:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:58:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510455666] [2024-11-09 07:58:57,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510455666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:57,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:58:57,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511442960] [2024-11-09 07:58:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:57,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:58:57,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:58:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:57,795 INFO L87 Difference]: Start difference. First operand 266 states and 323 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:57,842 INFO L93 Difference]: Finished difference Result 275 states and 327 transitions. [2024-11-09 07:58:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:58:57,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 07:58:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:57,844 INFO L225 Difference]: With dead ends: 275 [2024-11-09 07:58:57,844 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 07:58:57,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:58:57,845 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:57,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:58:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 07:58:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2024-11-09 07:58:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 240 states have (on average 1.3208333333333333) internal successors, (317), 265 states have internal predecessors, (317), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 324 transitions. [2024-11-09 07:58:57,851 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 324 transitions. Word has length 38 [2024-11-09 07:58:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:57,851 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 324 transitions. [2024-11-09 07:58:57,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 324 transitions. [2024-11-09 07:58:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:58:57,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:57,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:57,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 07:58:57,852 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:57,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1619591694, now seen corresponding path program 1 times [2024-11-09 07:58:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:57,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998867766] [2024-11-09 07:58:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:57,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:57,977 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-09 07:58:57,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:57,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998867766] [2024-11-09 07:58:57,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998867766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:57,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:58:57,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126482777] [2024-11-09 07:58:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:57,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:58:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:58:57,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:58:57,978 INFO L87 Difference]: Start difference. First operand 267 states and 324 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:58,135 INFO L93 Difference]: Finished difference Result 277 states and 334 transitions. [2024-11-09 07:58:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:58:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 07:58:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:58,136 INFO L225 Difference]: With dead ends: 277 [2024-11-09 07:58:58,136 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 07:58:58,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:58:58,137 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:58,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 443 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:58:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 07:58:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 264. [2024-11-09 07:58:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 238 states have (on average 1.315126050420168) internal successors, (313), 262 states have internal predecessors, (313), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 319 transitions. [2024-11-09 07:58:58,146 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 319 transitions. Word has length 39 [2024-11-09 07:58:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:58,146 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 319 transitions. [2024-11-09 07:58:58,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 319 transitions. [2024-11-09 07:58:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:58:58,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:58,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:58,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 07:58:58,150 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:58,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1028181111, now seen corresponding path program 1 times [2024-11-09 07:58:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347329055] [2024-11-09 07:58:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:58,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:58,772 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-09 07:58:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347329055] [2024-11-09 07:58:58,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347329055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:58:58,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:58:58,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:58:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612912144] [2024-11-09 07:58:58,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:58:58,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:58:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:58:58,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:58:58,775 INFO L87 Difference]: Start difference. First operand 264 states and 319 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:59,514 INFO L93 Difference]: Finished difference Result 335 states and 385 transitions. [2024-11-09 07:58:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:58:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 07:58:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:59,516 INFO L225 Difference]: With dead ends: 335 [2024-11-09 07:58:59,516 INFO L226 Difference]: Without dead ends: 335 [2024-11-09 07:58:59,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:58:59,518 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 395 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:59,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1045 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:58:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-09 07:58:59,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 264. [2024-11-09 07:58:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 262 states have internal predecessors, (312), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 318 transitions. [2024-11-09 07:58:59,525 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 318 transitions. Word has length 41 [2024-11-09 07:58:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:59,525 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 318 transitions. [2024-11-09 07:58:59,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:58:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 318 transitions. [2024-11-09 07:58:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:58:59,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:59,526 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:59,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 07:58:59,527 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:58:59,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash -78131331, now seen corresponding path program 1 times [2024-11-09 07:58:59,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:59,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479605309] [2024-11-09 07:58:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:58:59,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:59,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479605309] [2024-11-09 07:58:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479605309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:59,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086073705] [2024-11-09 07:58:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:59,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:59,697 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-09 07:58:59,699 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-09 07:58:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:59,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:58:59,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:59,816 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-09 07:58:59,820 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-09 07:58:59,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:58:59,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:59:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:00,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086073705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:00,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:00,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-09 07:59:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929003324] [2024-11-09 07:59:00,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:00,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:59:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:59:00,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:59:00,158 INFO L87 Difference]: Start difference. First operand 264 states and 318 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:00,594 INFO L93 Difference]: Finished difference Result 364 states and 426 transitions. [2024-11-09 07:59:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:59:00,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 07:59:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:00,596 INFO L225 Difference]: With dead ends: 364 [2024-11-09 07:59:00,596 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 07:59:00,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:59:00,598 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 128 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:00,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 863 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 07:59:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 288. [2024-11-09 07:59:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 286 states have internal predecessors, (347), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 353 transitions. [2024-11-09 07:59:00,605 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 353 transitions. Word has length 41 [2024-11-09 07:59:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:00,605 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 353 transitions. [2024-11-09 07:59:00,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 353 transitions. [2024-11-09 07:59:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:59:00,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:00,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:00,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:59:00,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-09 07:59:00,811 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:00,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1872897221, now seen corresponding path program 1 times [2024-11-09 07:59:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:00,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200515143] [2024-11-09 07:59:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:00,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:00,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200515143] [2024-11-09 07:59:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200515143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516385617] [2024-11-09 07:59:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:00,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:00,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:00,914 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-09 07:59:00,916 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-09 07:59:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:01,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:59:01,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:01,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:59:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:01,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:01,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516385617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:01,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:01,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-09 07:59:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073394853] [2024-11-09 07:59:01,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:01,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:01,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:01,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:01,168 INFO L87 Difference]: Start difference. First operand 288 states and 353 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:01,300 INFO L93 Difference]: Finished difference Result 319 states and 384 transitions. [2024-11-09 07:59:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:59:01,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 07:59:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:01,302 INFO L225 Difference]: With dead ends: 319 [2024-11-09 07:59:01,302 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 07:59:01,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:01,304 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:01,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 07:59:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-09 07:59:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.3159851301115242) internal successors, (354), 293 states have internal predecessors, (354), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2024-11-09 07:59:01,309 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 42 [2024-11-09 07:59:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:01,309 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2024-11-09 07:59:01,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2024-11-09 07:59:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:59:01,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:01,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:01,330 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-09 07:59:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:01,515 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:01,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash 681686168, now seen corresponding path program 1 times [2024-11-09 07:59:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374171835] [2024-11-09 07:59:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374171835] [2024-11-09 07:59:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374171835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:59:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356209614] [2024-11-09 07:59:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:01,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:59:01,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:01,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:59:01,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:59:01,736 INFO L87 Difference]: Start difference. First operand 295 states and 360 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:02,151 INFO L93 Difference]: Finished difference Result 328 states and 393 transitions. [2024-11-09 07:59:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:59:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 07:59:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:02,153 INFO L225 Difference]: With dead ends: 328 [2024-11-09 07:59:02,153 INFO L226 Difference]: Without dead ends: 328 [2024-11-09 07:59:02,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:59:02,154 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 346 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:02,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 510 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-09 07:59:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 302. [2024-11-09 07:59:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.318840579710145) internal successors, (364), 300 states have internal predecessors, (364), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 370 transitions. [2024-11-09 07:59:02,160 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 370 transitions. Word has length 42 [2024-11-09 07:59:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:02,160 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 370 transitions. [2024-11-09 07:59:02,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 370 transitions. [2024-11-09 07:59:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:59:02,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:02,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:02,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 07:59:02,162 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 681686169, now seen corresponding path program 1 times [2024-11-09 07:59:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:02,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417926603] [2024-11-09 07:59:02,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:02,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:02,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417926603] [2024-11-09 07:59:02,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417926603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:02,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:02,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:59:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106398681] [2024-11-09 07:59:02,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:02,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:59:02,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:02,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:59:02,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:59:02,494 INFO L87 Difference]: Start difference. First operand 302 states and 370 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:02,874 INFO L93 Difference]: Finished difference Result 326 states and 392 transitions. [2024-11-09 07:59:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:59:02,874 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 07:59:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:02,876 INFO L225 Difference]: With dead ends: 326 [2024-11-09 07:59:02,876 INFO L226 Difference]: Without dead ends: 326 [2024-11-09 07:59:02,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:59:02,877 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 289 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:02,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 464 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-09 07:59:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 308. [2024-11-09 07:59:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 282 states have (on average 1.3156028368794326) internal successors, (371), 306 states have internal predecessors, (371), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 377 transitions. [2024-11-09 07:59:02,883 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 377 transitions. Word has length 42 [2024-11-09 07:59:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:02,883 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 377 transitions. [2024-11-09 07:59:02,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 377 transitions. [2024-11-09 07:59:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:59:02,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:02,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:02,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 07:59:02,884 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:02,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash -342607706, now seen corresponding path program 1 times [2024-11-09 07:59:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:02,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368201886] [2024-11-09 07:59:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:02,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368201886] [2024-11-09 07:59:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368201886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:02,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:02,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798030711] [2024-11-09 07:59:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:02,920 INFO L87 Difference]: Start difference. First operand 308 states and 377 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:02,976 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2024-11-09 07:59:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 07:59:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:02,978 INFO L225 Difference]: With dead ends: 307 [2024-11-09 07:59:02,978 INFO L226 Difference]: Without dead ends: 307 [2024-11-09 07:59:02,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:02,979 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 66 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:02,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 167 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-09 07:59:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-09 07:59:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 282 states have (on average 1.301418439716312) internal successors, (367), 305 states have internal predecessors, (367), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 372 transitions. [2024-11-09 07:59:02,984 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 372 transitions. Word has length 43 [2024-11-09 07:59:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 372 transitions. [2024-11-09 07:59:02,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2024-11-09 07:59:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:59:02,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:02,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:02,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 07:59:02,986 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -508727926, now seen corresponding path program 1 times [2024-11-09 07:59:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001209886] [2024-11-09 07:59:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001209886] [2024-11-09 07:59:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001209886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:59:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43703477] [2024-11-09 07:59:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:59:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:59:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:03,241 INFO L87 Difference]: Start difference. First operand 307 states and 372 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-09 07:59:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:03,547 INFO L93 Difference]: Finished difference Result 327 states and 388 transitions. [2024-11-09 07:59:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:59:03,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 46 [2024-11-09 07:59:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:03,549 INFO L225 Difference]: With dead ends: 327 [2024-11-09 07:59:03,549 INFO L226 Difference]: Without dead ends: 327 [2024-11-09 07:59:03,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:59:03,550 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 140 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:03,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 447 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-09 07:59:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 306. [2024-11-09 07:59:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 281 states have (on average 1.298932384341637) internal successors, (365), 304 states have internal predecessors, (365), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 370 transitions. [2024-11-09 07:59:03,556 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 370 transitions. Word has length 46 [2024-11-09 07:59:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 370 transitions. [2024-11-09 07:59:03,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-09 07:59:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 370 transitions. [2024-11-09 07:59:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:59:03,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:03,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 07:59:03,557 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 493666388, now seen corresponding path program 1 times [2024-11-09 07:59:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845989193] [2024-11-09 07:59:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845989193] [2024-11-09 07:59:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845989193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140339313] [2024-11-09 07:59:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:03,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:03,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:03,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:03,598 INFO L87 Difference]: Start difference. First operand 306 states and 370 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-09 07:59:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:03,610 INFO L93 Difference]: Finished difference Result 361 states and 442 transitions. [2024-11-09 07:59:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 46 [2024-11-09 07:59:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:03,612 INFO L225 Difference]: With dead ends: 361 [2024-11-09 07:59:03,612 INFO L226 Difference]: Without dead ends: 361 [2024-11-09 07:59:03,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:03,613 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 11 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:03,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:59:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-09 07:59:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 343. [2024-11-09 07:59:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 318 states have (on average 1.330188679245283) internal successors, (423), 341 states have internal predecessors, (423), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 428 transitions. [2024-11-09 07:59:03,620 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 428 transitions. Word has length 46 [2024-11-09 07:59:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:03,620 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 428 transitions. [2024-11-09 07:59:03,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-09 07:59:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 428 transitions. [2024-11-09 07:59:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:59:03,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:03,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:03,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 07:59:03,621 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:03,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 493246269, now seen corresponding path program 1 times [2024-11-09 07:59:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502884753] [2024-11-09 07:59:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:03,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502884753] [2024-11-09 07:59:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502884753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:59:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245121766] [2024-11-09 07:59:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:03,709 INFO L87 Difference]: Start difference. First operand 343 states and 428 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:03,805 INFO L93 Difference]: Finished difference Result 291 states and 340 transitions. [2024-11-09 07:59:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:59:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-09 07:59:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:03,807 INFO L225 Difference]: With dead ends: 291 [2024-11-09 07:59:03,807 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 07:59:03,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 07:59:03,808 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:03,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 549 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 07:59:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-09 07:59:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.2584269662921348) internal successors, (336), 289 states have internal predecessors, (336), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2024-11-09 07:59:03,813 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 46 [2024-11-09 07:59:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:03,813 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2024-11-09 07:59:03,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2024-11-09 07:59:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:59:03,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:03,814 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:03,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 07:59:03,815 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:03,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1273739832, now seen corresponding path program 1 times [2024-11-09 07:59:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:03,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822571848] [2024-11-09 07:59:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:03,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822571848] [2024-11-09 07:59:03,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822571848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:03,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:03,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:03,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059672784] [2024-11-09 07:59:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:03,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:03,924 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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-09 07:59:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:04,026 INFO L93 Difference]: Finished difference Result 304 states and 353 transitions. [2024-11-09 07:59:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-09 07:59:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:04,027 INFO L225 Difference]: With dead ends: 304 [2024-11-09 07:59:04,027 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 07:59:04,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:59:04,029 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 11 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:04,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 477 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 07:59:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2024-11-09 07:59:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 270 states have (on average 1.2518518518518518) internal successors, (338), 292 states have internal predecessors, (338), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 342 transitions. [2024-11-09 07:59:04,034 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 342 transitions. Word has length 48 [2024-11-09 07:59:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:04,035 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 342 transitions. [2024-11-09 07:59:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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-09 07:59:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 342 transitions. [2024-11-09 07:59:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:59:04,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:04,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-09 07:59:04,036 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash 48115215, now seen corresponding path program 1 times [2024-11-09 07:59:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830973336] [2024-11-09 07:59:04,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:59:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830973336] [2024-11-09 07:59:04,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830973336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:04,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:04,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:59:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102915023] [2024-11-09 07:59:04,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:04,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:59:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:04,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:59:04,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:59:04,308 INFO L87 Difference]: Start difference. First operand 294 states and 342 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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-09 07:59:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:04,671 INFO L93 Difference]: Finished difference Result 281 states and 328 transitions. [2024-11-09 07:59:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:59:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-09 07:59:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:04,673 INFO L225 Difference]: With dead ends: 281 [2024-11-09 07:59:04,673 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 07:59:04,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:59:04,674 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 388 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:04,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 605 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 07:59:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 271. [2024-11-09 07:59:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 247 states have (on average 1.2672064777327936) internal successors, (313), 269 states have internal predecessors, (313), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 317 transitions. [2024-11-09 07:59:04,680 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 317 transitions. Word has length 49 [2024-11-09 07:59:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:04,680 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 317 transitions. [2024-11-09 07:59:04,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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-09 07:59:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 317 transitions. [2024-11-09 07:59:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:59:04,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:04,681 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:04,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 07:59:04,682 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:04,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash 859594147, now seen corresponding path program 1 times [2024-11-09 07:59:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857797423] [2024-11-09 07:59:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:05,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857797423] [2024-11-09 07:59:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857797423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:05,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376138831] [2024-11-09 07:59:05,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:05,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:05,420 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-09 07:59:05,422 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-09 07:59:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:05,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:59:05,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:05,558 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-09 07:59:05,596 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-09 07:59:05,603 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-09 07:59:05,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:05,772 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-09 07:59:05,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:05,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-09 07:59:05,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:05,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-09 07:59:05,964 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:05,965 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 31 treesize of output 22 [2024-11-09 07:59:05,985 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:59:05,985 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-09 07:59:06,120 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:59:06,120 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 48 treesize of output 43 [2024-11-09 07:59:06,126 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-09 07:59:06,393 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-09 07:59:06,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:06,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1068 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1067 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:59:06,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1067 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1068 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:59:08,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1068 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1062)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1067 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) is different from false [2024-11-09 07:59:10,427 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:10,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:10,433 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-09 07:59:10,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:59:10,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 7 treesize of output 3 [2024-11-09 07:59:10,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:10,454 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-09 07:59:10,454 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-09 07:59:10,495 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-09 07:59:10,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376138831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:10,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:10,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 34 [2024-11-09 07:59:10,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266806440] [2024-11-09 07:59:10,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:10,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:59:10,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:59:10,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=779, Unknown=7, NotChecked=180, Total=1122 [2024-11-09 07:59:10,497 INFO L87 Difference]: Start difference. First operand 271 states and 317 transitions. Second operand has 34 states, 34 states have (on average 3.9705882352941178) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 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-09 07:59:14,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:18,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:22,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:27,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:35,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:43,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:56,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]