./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0217.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:09:54,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:09:55,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:09:55,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:09:55,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:09:55,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:09:55,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:09:55,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:09:55,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:09:55,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:09:55,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:09:55,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:09:55,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:09:55,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:09:55,078 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:09:55,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:09:55,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:09:55,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:09:55,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:09:55,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:09:55,082 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:09:55,087 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:09:55,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:09:55,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:09:55,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:09:55,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:09:55,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:09:55,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:09:55,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:09:55,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:09:55,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:09:55,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:09:55,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:09:55,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:09:55,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:09:55,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:09:55,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:09:55,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:09:55,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:09:55,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:09:55,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:09:55,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:09:55,095 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2024-11-10 15:09:55,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:09:55,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:09:55,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:09:55,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:09:55,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:09:55,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2024-11-10 15:09:56,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:09:56,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:09:56,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2024-11-10 15:09:56,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e6cdeef/249d9a912a884e43b9bfa25bab6cf76e/FLAGa352c70a0 [2024-11-10 15:09:57,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e6cdeef/249d9a912a884e43b9bfa25bab6cf76e [2024-11-10 15:09:57,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:09:57,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:09:57,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:09:57,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:09:57,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:09:57,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160e7382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57, skipping insertion in model container [2024-11-10 15:09:57,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:09:57,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:09:57,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:09:57,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:09:57,395 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:09:57,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57 WrapperNode [2024-11-10 15:09:57,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:09:57,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:09:57,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:09:57,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:09:57,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,441 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2024-11-10 15:09:57,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:09:57,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:09:57,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:09:57,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:09:57,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,493 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2024-11-10 15:09:57,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:09:57,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:09:57,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:09:57,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:09:57,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (1/1) ... [2024-11-10 15:09:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:09:57,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:09:57,557 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-10 15:09:57,562 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-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-11-10 15:09:57,607 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:09:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:09:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:09:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:09:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:09:57,727 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:09:57,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:09:58,091 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2024-11-10 15:09:58,091 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:09:58,103 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:09:58,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:09:58,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:58 BoogieIcfgContainer [2024-11-10 15:09:58,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:09:58,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:09:58,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:09:58,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:09:58,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:09:57" (1/3) ... [2024-11-10 15:09:58,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2145c326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:58, skipping insertion in model container [2024-11-10 15:09:58,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:57" (2/3) ... [2024-11-10 15:09:58,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2145c326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:58, skipping insertion in model container [2024-11-10 15:09:58,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:58" (3/3) ... [2024-11-10 15:09:58,111 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0217.i [2024-11-10 15:09:58,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:09:58,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-10 15:09:58,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:09:58,169 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;@77f92062, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:09:58,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-11-10 15:09:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 105 states have (on average 1.8761904761904762) internal successors, (197), 172 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:09:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:09:58,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:58,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:09:58,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:09:58,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1550230993, now seen corresponding path program 1 times [2024-11-10 15:09:58,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:09:58,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752702720] [2024-11-10 15:09:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:09:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:58,344 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-10 15:09:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:09:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752702720] [2024-11-10 15:09:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752702720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:58,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:09:58,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718986484] [2024-11-10 15:09:58,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:58,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 15:09:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:09:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 15:09:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:09:58,424 INFO L87 Difference]: Start difference. First operand has 176 states, 105 states have (on average 1.8761904761904762) internal successors, (197), 172 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-10 15:09:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:58,444 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2024-11-10 15:09:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 15:09:58,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-10 15:09:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:58,451 INFO L225 Difference]: With dead ends: 176 [2024-11-10 15:09:58,451 INFO L226 Difference]: Without dead ends: 173 [2024-11-10 15:09:58,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:09:58,455 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:58,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:09:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-10 15:09:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-10 15:09:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.825242718446602) internal successors, (188), 169 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:09:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2024-11-10 15:09:58,488 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 6 [2024-11-10 15:09:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:58,488 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2024-11-10 15:09:58,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-10 15:09:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2024-11-10 15:09:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:09:58,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:58,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:58,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:09:58,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:09:58,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash -808317985, now seen corresponding path program 1 times [2024-11-10 15:09:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:09:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15732111] [2024-11-10 15:09:58,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:09:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:58,573 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-10 15:09:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:09:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15732111] [2024-11-10 15:09:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15732111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:58,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 15:09:58,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491161778] [2024-11-10 15:09:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:58,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:09:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:09:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:09:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:09:58,578 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-10 15:09:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:58,786 INFO L93 Difference]: Finished difference Result 336 states and 373 transitions. [2024-11-10 15:09:58,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:09:58,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-10 15:09:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:58,789 INFO L225 Difference]: With dead ends: 336 [2024-11-10 15:09:58,789 INFO L226 Difference]: Without dead ends: 336 [2024-11-10 15:09:58,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10 15:09:58,792 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:58,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 243 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:09:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-10 15:09:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 238. [2024-11-10 15:09:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 165 states have (on average 1.8242424242424242) internal successors, (301), 231 states have internal predecessors, (301), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:09:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2024-11-10 15:09:58,807 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 7 [2024-11-10 15:09:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:58,807 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2024-11-10 15:09:58,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-10 15:09:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2024-11-10 15:09:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:09:58,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:58,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:58,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:09:58,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:09:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash -808317984, now seen corresponding path program 1 times [2024-11-10 15:09:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:09:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383006004] [2024-11-10 15:09:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:09:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:58,980 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-10 15:09:58,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:09:58,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383006004] [2024-11-10 15:09:58,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383006004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:58,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:58,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:09:58,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466504712] [2024-11-10 15:09:58,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:09:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:09:58,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:09:58,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:09:58,983 INFO L87 Difference]: Start difference. First operand 238 states and 309 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-10 15:09:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:59,143 INFO L93 Difference]: Finished difference Result 369 states and 463 transitions. [2024-11-10 15:09:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:09:59,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-10 15:09:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:59,145 INFO L225 Difference]: With dead ends: 369 [2024-11-10 15:09:59,147 INFO L226 Difference]: Without dead ends: 369 [2024-11-10 15:09:59,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:09:59,148 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 109 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:59,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 421 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:09:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-10 15:09:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 315. [2024-11-10 15:09:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 236 states have (on average 1.7881355932203389) internal successors, (422), 304 states have internal predecessors, (422), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:09:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 438 transitions. [2024-11-10 15:09:59,178 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 438 transitions. Word has length 7 [2024-11-10 15:09:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:59,179 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 438 transitions. [2024-11-10 15:09:59,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-10 15:09:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 438 transitions. [2024-11-10 15:09:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:09:59,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:59,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:09:59,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:09:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -808317953, now seen corresponding path program 1 times [2024-11-10 15:09:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:09:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305101174] [2024-11-10 15:09:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:09:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:59,288 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-10 15:09:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:09:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305101174] [2024-11-10 15:09:59,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305101174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:59,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:09:59,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744022389] [2024-11-10 15:09:59,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:59,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:09:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:09:59,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:09:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:09:59,291 INFO L87 Difference]: Start difference. First operand 315 states and 438 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-10 15:09:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:59,445 INFO L93 Difference]: Finished difference Result 368 states and 461 transitions. [2024-11-10 15:09:59,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:09:59,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-10 15:09:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:59,447 INFO L225 Difference]: With dead ends: 368 [2024-11-10 15:09:59,447 INFO L226 Difference]: Without dead ends: 368 [2024-11-10 15:09:59,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:09:59,450 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 107 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:59,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 374 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:09:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-10 15:09:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 315. [2024-11-10 15:09:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 236 states have (on average 1.7881355932203389) internal successors, (422), 304 states have internal predecessors, (422), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:09:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 438 transitions. [2024-11-10 15:09:59,471 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 438 transitions. Word has length 7 [2024-11-10 15:09:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:59,471 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 438 transitions. [2024-11-10 15:09:59,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-10 15:09:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 438 transitions. [2024-11-10 15:09:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:09:59,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:59,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:59,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:09:59,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:09:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1041802041, now seen corresponding path program 1 times [2024-11-10 15:09:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:09:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27170246] [2024-11-10 15:09:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:09:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:59,741 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-10 15:09:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:09:59,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27170246] [2024-11-10 15:09:59,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27170246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:09:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587837183] [2024-11-10 15:09:59,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:59,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:09:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:09:59,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:09:59,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:09:59,744 INFO L87 Difference]: Start difference. First operand 315 states and 438 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) 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-10 15:09:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:59,896 INFO L93 Difference]: Finished difference Result 468 states and 623 transitions. [2024-11-10 15:09:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:09:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) 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-10 15:09:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:59,900 INFO L225 Difference]: With dead ends: 468 [2024-11-10 15:09:59,901 INFO L226 Difference]: Without dead ends: 468 [2024-11-10 15:09:59,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:09:59,902 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 139 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:59,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 765 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:09:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-10 15:09:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 361. [2024-11-10 15:09:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 279 states have (on average 1.7670250896057347) internal successors, (493), 348 states have internal predecessors, (493), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:09:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 513 transitions. [2024-11-10 15:09:59,926 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 513 transitions. Word has length 11 [2024-11-10 15:09:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:59,926 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 513 transitions. [2024-11-10 15:09:59,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) 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-10 15:09:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 513 transitions. [2024-11-10 15:09:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:09:59,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:59,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:59,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:09:59,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:09:59,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1070431192, now seen corresponding path program 1 times [2024-11-10 15:09:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:09:59,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621466947] [2024-11-10 15:09:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:09:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,010 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-10 15:10:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621466947] [2024-11-10 15:10:00,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621466947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:00,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:00,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736844380] [2024-11-10 15:10:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:00,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:00,015 INFO L87 Difference]: Start difference. First operand 361 states and 513 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) 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-10 15:10:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:00,153 INFO L93 Difference]: Finished difference Result 457 states and 611 transitions. [2024-11-10 15:10:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) 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-10 15:10:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:00,155 INFO L225 Difference]: With dead ends: 457 [2024-11-10 15:10:00,155 INFO L226 Difference]: Without dead ends: 457 [2024-11-10 15:10:00,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:00,156 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 122 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:00,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 764 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-10 15:10:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 360. [2024-11-10 15:10:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 278 states have (on average 1.7697841726618706) internal successors, (492), 347 states have internal predecessors, (492), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:10:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 512 transitions. [2024-11-10 15:10:00,165 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 512 transitions. Word has length 11 [2024-11-10 15:10:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:00,165 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 512 transitions. [2024-11-10 15:10:00,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) 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-10 15:10:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 512 transitions. [2024-11-10 15:10:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:10:00,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:00,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:00,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:10:00,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:00,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 444342255, now seen corresponding path program 1 times [2024-11-10 15:10:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071091854] [2024-11-10 15:10:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,181 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-10 15:10:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071091854] [2024-11-10 15:10:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071091854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:10:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018361363] [2024-11-10 15:10:00,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:00,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:10:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:10:00,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:10:00,183 INFO L87 Difference]: Start difference. First operand 360 states and 512 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-10 15:10:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:00,270 INFO L93 Difference]: Finished difference Result 416 states and 564 transitions. [2024-11-10 15:10:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:10:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-10 15:10:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:00,271 INFO L225 Difference]: With dead ends: 416 [2024-11-10 15:10:00,271 INFO L226 Difference]: Without dead ends: 407 [2024-11-10 15:10:00,272 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-10 15:10:00,272 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:00,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 282 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-10 15:10:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 357. [2024-11-10 15:10:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 275 states have (on average 1.770909090909091) internal successors, (487), 344 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:10:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 507 transitions. [2024-11-10 15:10:00,279 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 507 transitions. Word has length 13 [2024-11-10 15:10:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 507 transitions. [2024-11-10 15:10:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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-10 15:10:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 507 transitions. [2024-11-10 15:10:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:10:00,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:00,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:00,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:10:00,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:00,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash -874243006, now seen corresponding path program 1 times [2024-11-10 15:10:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:00,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550565564] [2024-11-10 15:10:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:00,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:10:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,367 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-10 15:10:00,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:00,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550565564] [2024-11-10 15:10:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550565564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:00,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:00,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831852385] [2024-11-10 15:10:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:00,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:00,371 INFO L87 Difference]: Start difference. First operand 357 states and 507 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:00,536 INFO L93 Difference]: Finished difference Result 474 states and 611 transitions. [2024-11-10 15:10:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:00,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:10:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:00,539 INFO L225 Difference]: With dead ends: 474 [2024-11-10 15:10:00,539 INFO L226 Difference]: Without dead ends: 474 [2024-11-10 15:10:00,539 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-10 15:10:00,539 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 177 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:00,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 352 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-10 15:10:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 363. [2024-11-10 15:10:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 281 states have (on average 1.7544483985765125) internal successors, (493), 350 states have internal predecessors, (493), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:10:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 513 transitions. [2024-11-10 15:10:00,549 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 513 transitions. Word has length 15 [2024-11-10 15:10:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 513 transitions. [2024-11-10 15:10:00,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 513 transitions. [2024-11-10 15:10:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:10:00,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:00,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:00,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:10:00,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:00,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -874243005, now seen corresponding path program 1 times [2024-11-10 15:10:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739983625] [2024-11-10 15:10:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:10:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,618 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-10 15:10:00,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:00,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739983625] [2024-11-10 15:10:00,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739983625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:00,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:00,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477094811] [2024-11-10 15:10:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:00,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:00,621 INFO L87 Difference]: Start difference. First operand 363 states and 513 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:00,746 INFO L93 Difference]: Finished difference Result 414 states and 528 transitions. [2024-11-10 15:10:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:10:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:00,748 INFO L225 Difference]: With dead ends: 414 [2024-11-10 15:10:00,748 INFO L226 Difference]: Without dead ends: 414 [2024-11-10 15:10:00,748 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-10 15:10:00,749 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 109 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:00,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 458 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-10 15:10:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 363. [2024-11-10 15:10:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 281 states have (on average 1.7224199288256228) internal successors, (484), 350 states have internal predecessors, (484), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:10:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 504 transitions. [2024-11-10 15:10:00,755 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 504 transitions. Word has length 15 [2024-11-10 15:10:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:00,756 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 504 transitions. [2024-11-10 15:10:00,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 504 transitions. [2024-11-10 15:10:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:10:00,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:00,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:00,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:10:00,757 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1785410869, now seen corresponding path program 1 times [2024-11-10 15:10:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526581606] [2024-11-10 15:10:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:00,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,835 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-10 15:10:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526581606] [2024-11-10 15:10:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526581606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:00,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:10:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394790117] [2024-11-10 15:10:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:00,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:10:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:10:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:10:00,837 INFO L87 Difference]: Start difference. First operand 363 states and 504 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:01,055 INFO L93 Difference]: Finished difference Result 491 states and 633 transitions. [2024-11-10 15:10:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 15:10:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:01,057 INFO L225 Difference]: With dead ends: 491 [2024-11-10 15:10:01,057 INFO L226 Difference]: Without dead ends: 491 [2024-11-10 15:10:01,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:01,058 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 318 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:01,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 420 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-10 15:10:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 361. [2024-11-10 15:10:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 283 states have (on average 1.6925795053003534) internal successors, (479), 348 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:10:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 499 transitions. [2024-11-10 15:10:01,068 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 499 transitions. Word has length 18 [2024-11-10 15:10:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:01,069 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 499 transitions. [2024-11-10 15:10:01,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 499 transitions. [2024-11-10 15:10:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:10:01,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:01,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:01,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:10:01,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1785410870, now seen corresponding path program 1 times [2024-11-10 15:10:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870878013] [2024-11-10 15:10:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:01,234 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-10 15:10:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:01,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870878013] [2024-11-10 15:10:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870878013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:01,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:01,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:10:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708406488] [2024-11-10 15:10:01,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:10:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:01,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:10:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:01,236 INFO L87 Difference]: Start difference. First operand 361 states and 499 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:01,607 INFO L93 Difference]: Finished difference Result 520 states and 661 transitions. [2024-11-10 15:10:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:10:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 15:10:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:01,609 INFO L225 Difference]: With dead ends: 520 [2024-11-10 15:10:01,609 INFO L226 Difference]: Without dead ends: 520 [2024-11-10 15:10:01,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:10:01,610 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 260 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:01,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 558 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-10 15:10:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 395. [2024-11-10 15:10:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 315 states have (on average 1.6825396825396826) internal successors, (530), 381 states have internal predecessors, (530), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-10 15:10:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 554 transitions. [2024-11-10 15:10:01,619 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 554 transitions. Word has length 18 [2024-11-10 15:10:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:01,619 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 554 transitions. [2024-11-10 15:10:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 554 transitions. [2024-11-10 15:10:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:10:01,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:01,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:01,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:10:01,622 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1588897365, now seen corresponding path program 1 times [2024-11-10 15:10:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096269060] [2024-11-10 15:10:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:01,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:01,686 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-10 15:10:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:01,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096269060] [2024-11-10 15:10:01,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096269060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:01,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:01,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:10:01,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351495811] [2024-11-10 15:10:01,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:01,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:01,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:01,688 INFO L87 Difference]: Start difference. First operand 395 states and 554 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:01,714 INFO L93 Difference]: Finished difference Result 405 states and 566 transitions. [2024-11-10 15:10:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 15:10:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:01,718 INFO L225 Difference]: With dead ends: 405 [2024-11-10 15:10:01,718 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 15:10:01,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:01,719 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:01,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 941 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:10:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 15:10:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-11-10 15:10:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 322 states have (on average 1.6645962732919255) internal successors, (536), 390 states have internal predecessors, (536), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 566 transitions. [2024-11-10 15:10:01,728 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 566 transitions. Word has length 18 [2024-11-10 15:10:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:01,729 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 566 transitions. [2024-11-10 15:10:01,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 566 transitions. [2024-11-10 15:10:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:10:01,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:01,730 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-10 15:10:01,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:10:01,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:01,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2013086818, now seen corresponding path program 1 times [2024-11-10 15:10:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:01,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812078249] [2024-11-10 15:10:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812078249] [2024-11-10 15:10:01,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812078249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:10:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884620217] [2024-11-10 15:10:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:01,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:10:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:10:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:10:01,989 INFO L87 Difference]: Start difference. First operand 405 states and 566 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:02,441 INFO L93 Difference]: Finished difference Result 546 states and 702 transitions. [2024-11-10 15:10:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:10:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-10 15:10:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:02,443 INFO L225 Difference]: With dead ends: 546 [2024-11-10 15:10:02,443 INFO L226 Difference]: Without dead ends: 546 [2024-11-10 15:10:02,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:10:02,443 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 287 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:02,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 736 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-10 15:10:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 401. [2024-11-10 15:10:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 318 states have (on average 1.6666666666666667) internal successors, (530), 386 states have internal predecessors, (530), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 560 transitions. [2024-11-10 15:10:02,456 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 560 transitions. Word has length 19 [2024-11-10 15:10:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:02,456 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 560 transitions. [2024-11-10 15:10:02,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 560 transitions. [2024-11-10 15:10:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:10:02,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:02,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:02,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:10:02,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1585213893, now seen corresponding path program 1 times [2024-11-10 15:10:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54610011] [2024-11-10 15:10:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:10:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:02,656 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-10 15:10:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54610011] [2024-11-10 15:10:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54610011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:02,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:02,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:10:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060536628] [2024-11-10 15:10:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:02,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:10:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:02,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:10:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:02,658 INFO L87 Difference]: Start difference. First operand 401 states and 560 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:02,976 INFO L93 Difference]: Finished difference Result 499 states and 664 transitions. [2024-11-10 15:10:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:10:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-10 15:10:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:02,980 INFO L225 Difference]: With dead ends: 499 [2024-11-10 15:10:02,981 INFO L226 Difference]: Without dead ends: 499 [2024-11-10 15:10:02,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:02,981 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 114 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:02,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1115 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-10 15:10:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 394. [2024-11-10 15:10:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 311 states have (on average 1.6655948553054662) internal successors, (518), 379 states have internal predecessors, (518), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 548 transitions. [2024-11-10 15:10:02,994 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 548 transitions. Word has length 21 [2024-11-10 15:10:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:02,994 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 548 transitions. [2024-11-10 15:10:02,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 548 transitions. [2024-11-10 15:10:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:10:02,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:02,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:02,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:10:02,996 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash 720996304, now seen corresponding path program 1 times [2024-11-10 15:10:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984139163] [2024-11-10 15:10:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:03,174 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-10 15:10:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984139163] [2024-11-10 15:10:03,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984139163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:03,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:10:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820298040] [2024-11-10 15:10:03,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:03,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:10:03,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:03,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:10:03,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:03,176 INFO L87 Difference]: Start difference. First operand 394 states and 548 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:03,362 INFO L93 Difference]: Finished difference Result 533 states and 710 transitions. [2024-11-10 15:10:03,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:10:03,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-10 15:10:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:03,364 INFO L225 Difference]: With dead ends: 533 [2024-11-10 15:10:03,364 INFO L226 Difference]: Without dead ends: 533 [2024-11-10 15:10:03,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:03,365 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 147 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:03,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1091 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-10 15:10:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 414. [2024-11-10 15:10:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 331 states have (on average 1.6435045317220545) internal successors, (544), 397 states have internal predecessors, (544), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 574 transitions. [2024-11-10 15:10:03,376 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 574 transitions. Word has length 22 [2024-11-10 15:10:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:03,377 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 574 transitions. [2024-11-10 15:10:03,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 574 transitions. [2024-11-10 15:10:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:10:03,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:03,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:03,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:10:03,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:03,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1323579671, now seen corresponding path program 1 times [2024-11-10 15:10:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837827588] [2024-11-10 15:10:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:03,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:10:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:03,451 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-10 15:10:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837827588] [2024-11-10 15:10:03,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837827588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:03,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:03,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:03,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793992795] [2024-11-10 15:10:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:03,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:03,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:03,455 INFO L87 Difference]: Start difference. First operand 414 states and 574 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:03,730 INFO L93 Difference]: Finished difference Result 515 states and 661 transitions. [2024-11-10 15:10:03,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:03,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 15:10:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:03,732 INFO L225 Difference]: With dead ends: 515 [2024-11-10 15:10:03,732 INFO L226 Difference]: Without dead ends: 515 [2024-11-10 15:10:03,732 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-10 15:10:03,732 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 186 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:03,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 361 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-10 15:10:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 434. [2024-11-10 15:10:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 351 states have (on average 1.6638176638176638) internal successors, (584), 417 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 614 transitions. [2024-11-10 15:10:03,742 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 614 transitions. Word has length 23 [2024-11-10 15:10:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:03,743 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 614 transitions. [2024-11-10 15:10:03,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 614 transitions. [2024-11-10 15:10:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:10:03,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:03,744 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-10 15:10:03,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:10:03,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:03,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1323579672, now seen corresponding path program 1 times [2024-11-10 15:10:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590783767] [2024-11-10 15:10:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 15:10:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:03,919 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-10 15:10:03,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590783767] [2024-11-10 15:10:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590783767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:03,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:10:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559942669] [2024-11-10 15:10:03,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:03,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:10:03,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:03,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:10:03,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:03,921 INFO L87 Difference]: Start difference. First operand 434 states and 614 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,075 INFO L93 Difference]: Finished difference Result 361 states and 475 transitions. [2024-11-10 15:10:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:10:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 15:10:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,078 INFO L225 Difference]: With dead ends: 361 [2024-11-10 15:10:04,078 INFO L226 Difference]: Without dead ends: 361 [2024-11-10 15:10:04,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:04,079 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 59 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1159 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-10 15:10:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 317. [2024-11-10 15:10:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 242 states have (on average 1.6611570247933884) internal successors, (402), 305 states have internal predecessors, (402), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 420 transitions. [2024-11-10 15:10:04,086 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 420 transitions. Word has length 23 [2024-11-10 15:10:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,086 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 420 transitions. [2024-11-10 15:10:04,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 420 transitions. [2024-11-10 15:10:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:10:04,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:04,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:10:04,089 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:04,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash -178773764, now seen corresponding path program 1 times [2024-11-10 15:10:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329276921] [2024-11-10 15:10:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,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-10 15:10:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329276921] [2024-11-10 15:10:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329276921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:10:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994134177] [2024-11-10 15:10:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:10:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:10:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:04,224 INFO L87 Difference]: Start difference. First operand 317 states and 420 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,411 INFO L93 Difference]: Finished difference Result 371 states and 484 transitions. [2024-11-10 15:10:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:10:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 15:10:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,413 INFO L225 Difference]: With dead ends: 371 [2024-11-10 15:10:04,413 INFO L226 Difference]: Without dead ends: 371 [2024-11-10 15:10:04,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:04,414 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 70 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1226 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-10 15:10:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 321. [2024-11-10 15:10:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 246 states have (on average 1.6504065040650406) internal successors, (406), 308 states have internal predecessors, (406), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 424 transitions. [2024-11-10 15:10:04,420 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 424 transitions. Word has length 23 [2024-11-10 15:10:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,420 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 424 transitions. [2024-11-10 15:10:04,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 424 transitions. [2024-11-10 15:10:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:10:04,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:04,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:10:04,421 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:04,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1397354392, now seen corresponding path program 1 times [2024-11-10 15:10:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677087168] [2024-11-10 15:10:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,449 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-10 15:10:04,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:04,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677087168] [2024-11-10 15:10:04,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677087168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:10:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824431158] [2024-11-10 15:10:04,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:04,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:04,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:04,452 INFO L87 Difference]: Start difference. First operand 321 states and 424 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,467 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2024-11-10 15:10:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:04,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-10 15:10:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,469 INFO L225 Difference]: With dead ends: 330 [2024-11-10 15:10:04,469 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 15:10:04,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:04,469 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:10:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 15:10:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-11-10 15:10:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 255 states have (on average 1.6274509803921569) internal successors, (415), 317 states have internal predecessors, (415), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 433 transitions. [2024-11-10 15:10:04,476 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 433 transitions. Word has length 26 [2024-11-10 15:10:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,476 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 433 transitions. [2024-11-10 15:10:04,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 433 transitions. [2024-11-10 15:10:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:10:04,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:04,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:10:04,477 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:04,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1396430871, now seen corresponding path program 1 times [2024-11-10 15:10:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780772435] [2024-11-10 15:10:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,503 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-10 15:10:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780772435] [2024-11-10 15:10:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780772435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:10:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961599463] [2024-11-10 15:10:04,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:10:04,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:04,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:10:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:10:04,506 INFO L87 Difference]: Start difference. First operand 330 states and 433 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,567 INFO L93 Difference]: Finished difference Result 327 states and 424 transitions. [2024-11-10 15:10:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:10:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-10 15:10:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,569 INFO L225 Difference]: With dead ends: 327 [2024-11-10 15:10:04,569 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 15:10:04,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10 15:10:04,569 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 255 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 15:10:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2024-11-10 15:10:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 255 states have (on average 1.592156862745098) internal successors, (406), 314 states have internal predecessors, (406), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 424 transitions. [2024-11-10 15:10:04,576 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 424 transitions. Word has length 26 [2024-11-10 15:10:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,577 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 424 transitions. [2024-11-10 15:10:04,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 424 transitions. [2024-11-10 15:10:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:10:04,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:10:04,578 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1396430870, now seen corresponding path program 1 times [2024-11-10 15:10:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428937544] [2024-11-10 15:10:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,676 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-10 15:10:04,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428937544] [2024-11-10 15:10:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428937544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59467202] [2024-11-10 15:10:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:04,677 INFO L87 Difference]: Start difference. First operand 327 states and 424 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,741 INFO L93 Difference]: Finished difference Result 392 states and 506 transitions. [2024-11-10 15:10:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:04,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-10 15:10:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,742 INFO L225 Difference]: With dead ends: 392 [2024-11-10 15:10:04,742 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 15:10:04,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:04,743 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 68 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 285 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 15:10:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 386. [2024-11-10 15:10:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 315 states have (on average 1.5492063492063493) internal successors, (488), 373 states have internal predecessors, (488), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 506 transitions. [2024-11-10 15:10:04,749 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 506 transitions. Word has length 26 [2024-11-10 15:10:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,749 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 506 transitions. [2024-11-10 15:10:04,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 506 transitions. [2024-11-10 15:10:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:10:04,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,749 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-10 15:10:04,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:10:04,749 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1192236715, now seen corresponding path program 1 times [2024-11-10 15:10:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:04,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136706652] [2024-11-10 15:10:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,791 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-10 15:10:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:04,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136706652] [2024-11-10 15:10:04,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136706652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:10:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116265428] [2024-11-10 15:10:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:04,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:04,793 INFO L87 Difference]: Start difference. First operand 386 states and 506 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,812 INFO L93 Difference]: Finished difference Result 433 states and 560 transitions. [2024-11-10 15:10:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:04,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-10 15:10:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,814 INFO L225 Difference]: With dead ends: 433 [2024-11-10 15:10:04,814 INFO L226 Difference]: Without dead ends: 433 [2024-11-10 15:10:04,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:04,814 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 47 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 895 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:10:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-10 15:10:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 386. [2024-11-10 15:10:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 315 states have (on average 1.5396825396825398) internal successors, (485), 373 states have internal predecessors, (485), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 503 transitions. [2024-11-10 15:10:04,820 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 503 transitions. Word has length 27 [2024-11-10 15:10:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,821 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 503 transitions. [2024-11-10 15:10:04,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 503 transitions. [2024-11-10 15:10:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:10:04,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,821 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-10 15:10:04,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:10:04,822 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:04,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2036708586, now seen corresponding path program 1 times [2024-11-10 15:10:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941824894] [2024-11-10 15:10:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,867 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-10 15:10:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941824894] [2024-11-10 15:10:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941824894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500946083] [2024-11-10 15:10:04,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:04,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:04,868 INFO L87 Difference]: Start difference. First operand 386 states and 503 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,941 INFO L93 Difference]: Finished difference Result 452 states and 588 transitions. [2024-11-10 15:10:04,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:04,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-10 15:10:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,943 INFO L225 Difference]: With dead ends: 452 [2024-11-10 15:10:04,943 INFO L226 Difference]: Without dead ends: 452 [2024-11-10 15:10:04,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:04,944 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 51 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 300 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-10 15:10:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 386. [2024-11-10 15:10:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 315 states have (on average 1.5396825396825398) internal successors, (485), 373 states have internal predecessors, (485), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 503 transitions. [2024-11-10 15:10:04,950 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 503 transitions. Word has length 27 [2024-11-10 15:10:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,950 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 503 transitions. [2024-11-10 15:10:04,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 503 transitions. [2024-11-10 15:10:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:10:04,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,951 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-10 15:10:04,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:10:04,951 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:04,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1907625867, now seen corresponding path program 1 times [2024-11-10 15:10:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:04,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315087687] [2024-11-10 15:10:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,998 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-10 15:10:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315087687] [2024-11-10 15:10:04,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315087687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:10:04,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432416775] [2024-11-10 15:10:04,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:05,000 INFO L87 Difference]: Start difference. First operand 386 states and 503 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:05,016 INFO L93 Difference]: Finished difference Result 325 states and 412 transitions. [2024-11-10 15:10:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-10 15:10:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:05,018 INFO L225 Difference]: With dead ends: 325 [2024-11-10 15:10:05,018 INFO L226 Difference]: Without dead ends: 325 [2024-11-10 15:10:05,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10 15:10:05,018 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:05,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 905 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:10:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-10 15:10:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-11-10 15:10:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 255 states have (on average 1.5450980392156863) internal successors, (394), 312 states have internal predecessors, (394), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 412 transitions. [2024-11-10 15:10:05,024 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 412 transitions. Word has length 27 [2024-11-10 15:10:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:05,024 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 412 transitions. [2024-11-10 15:10:05,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 412 transitions. [2024-11-10 15:10:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:10:05,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:05,025 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] [2024-11-10 15:10:05,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:10:05,025 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:05,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1940266781, now seen corresponding path program 1 times [2024-11-10 15:10:05,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:05,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42001785] [2024-11-10 15:10:05,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,075 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-10 15:10:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:05,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42001785] [2024-11-10 15:10:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42001785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197489171] [2024-11-10 15:10:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:05,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:05,077 INFO L87 Difference]: Start difference. First operand 325 states and 412 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:05,145 INFO L93 Difference]: Finished difference Result 414 states and 527 transitions. [2024-11-10 15:10:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-10 15:10:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:05,147 INFO L225 Difference]: With dead ends: 414 [2024-11-10 15:10:05,147 INFO L226 Difference]: Without dead ends: 414 [2024-11-10 15:10:05,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:05,148 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 82 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:05,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 285 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-10 15:10:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 397. [2024-11-10 15:10:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 327 states have (on average 1.529051987767584) internal successors, (500), 384 states have internal predecessors, (500), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 518 transitions. [2024-11-10 15:10:05,154 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 518 transitions. Word has length 28 [2024-11-10 15:10:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:05,154 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 518 transitions. [2024-11-10 15:10:05,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 518 transitions. [2024-11-10 15:10:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:10:05,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:05,155 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] [2024-11-10 15:10:05,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 15:10:05,156 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:05,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1940266747, now seen corresponding path program 1 times [2024-11-10 15:10:05,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:05,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806083381] [2024-11-10 15:10:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,230 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-10 15:10:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:05,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806083381] [2024-11-10 15:10:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806083381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:10:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367973789] [2024-11-10 15:10:05,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:05,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:10:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:10:05,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:05,258 INFO L87 Difference]: Start difference. First operand 397 states and 518 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:05,377 INFO L93 Difference]: Finished difference Result 453 states and 582 transitions. [2024-11-10 15:10:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:10:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-10 15:10:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:05,379 INFO L225 Difference]: With dead ends: 453 [2024-11-10 15:10:05,379 INFO L226 Difference]: Without dead ends: 453 [2024-11-10 15:10:05,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:10:05,379 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 12 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:05,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 920 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-10 15:10:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2024-11-10 15:10:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 375 states have (on average 1.48) internal successors, (555), 432 states have internal predecessors, (555), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 573 transitions. [2024-11-10 15:10:05,386 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 573 transitions. Word has length 28 [2024-11-10 15:10:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:05,386 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 573 transitions. [2024-11-10 15:10:05,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 573 transitions. [2024-11-10 15:10:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:10:05,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:05,387 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-10 15:10:05,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 15:10:05,387 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:05,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1228138767, now seen corresponding path program 1 times [2024-11-10 15:10:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366925683] [2024-11-10 15:10:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,442 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-10 15:10:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:05,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366925683] [2024-11-10 15:10:05,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366925683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:05,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:05,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166563597] [2024-11-10 15:10:05,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:05,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:05,443 INFO L87 Difference]: Start difference. First operand 445 states and 573 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:05,520 INFO L93 Difference]: Finished difference Result 470 states and 585 transitions. [2024-11-10 15:10:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-10 15:10:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:05,522 INFO L225 Difference]: With dead ends: 470 [2024-11-10 15:10:05,522 INFO L226 Difference]: Without dead ends: 470 [2024-11-10 15:10:05,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:05,523 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 58 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:05,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 305 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-10 15:10:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 354. [2024-11-10 15:10:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 285 states have (on average 1.4842105263157894) internal successors, (423), 341 states have internal predecessors, (423), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 441 transitions. [2024-11-10 15:10:05,530 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 441 transitions. Word has length 29 [2024-11-10 15:10:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:05,530 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 441 transitions. [2024-11-10 15:10:05,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 441 transitions. [2024-11-10 15:10:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:10:05,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:05,532 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-10 15:10:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:10:05,533 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -589134085, now seen corresponding path program 1 times [2024-11-10 15:10:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:05,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517783232] [2024-11-10 15:10:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,629 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-10 15:10:05,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517783232] [2024-11-10 15:10:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517783232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:05,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:05,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099181865] [2024-11-10 15:10:05,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:05,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:05,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:05,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:05,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:05,632 INFO L87 Difference]: Start difference. First operand 354 states and 441 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:05,749 INFO L93 Difference]: Finished difference Result 355 states and 441 transitions. [2024-11-10 15:10:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:05,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-10 15:10:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:05,750 INFO L225 Difference]: With dead ends: 355 [2024-11-10 15:10:05,750 INFO L226 Difference]: Without dead ends: 355 [2024-11-10 15:10:05,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10 15:10:05,751 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 40 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:05,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 602 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-10 15:10:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2024-11-10 15:10:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.4771929824561403) internal successors, (421), 340 states have internal predecessors, (421), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 439 transitions. [2024-11-10 15:10:05,756 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 439 transitions. Word has length 36 [2024-11-10 15:10:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:05,757 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 439 transitions. [2024-11-10 15:10:05,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 439 transitions. [2024-11-10 15:10:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:10:05,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:05,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] [2024-11-10 15:10:05,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 15:10:05,757 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:05,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -589134086, now seen corresponding path program 1 times [2024-11-10 15:10:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709415297] [2024-11-10 15:10:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:05,811 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-10 15:10:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709415297] [2024-11-10 15:10:05,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709415297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:05,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:05,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932951818] [2024-11-10 15:10:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:05,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:05,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:05,813 INFO L87 Difference]: Start difference. First operand 353 states and 439 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:05,932 INFO L93 Difference]: Finished difference Result 354 states and 439 transitions. [2024-11-10 15:10:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:05,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-10 15:10:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:05,934 INFO L225 Difference]: With dead ends: 354 [2024-11-10 15:10:05,934 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 15:10:05,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10 15:10:05,934 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 53 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:05,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 562 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 15:10:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-11-10 15:10:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 285 states have (on average 1.4701754385964911) internal successors, (419), 339 states have internal predecessors, (419), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 437 transitions. [2024-11-10 15:10:05,939 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 437 transitions. Word has length 36 [2024-11-10 15:10:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:05,940 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 437 transitions. [2024-11-10 15:10:05,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 437 transitions. [2024-11-10 15:10:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:10:05,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:05,940 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-10 15:10:05,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 15:10:05,941 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 777829431, now seen corresponding path program 1 times [2024-11-10 15:10:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853827874] [2024-11-10 15:10:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:06,038 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-10 15:10:06,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:06,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853827874] [2024-11-10 15:10:06,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853827874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:06,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:06,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:10:06,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590177720] [2024-11-10 15:10:06,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:06,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:10:06,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:10:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:10:06,040 INFO L87 Difference]: Start difference. First operand 352 states and 437 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:06,183 INFO L93 Difference]: Finished difference Result 396 states and 488 transitions. [2024-11-10 15:10:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:10:06,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-10 15:10:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:06,184 INFO L225 Difference]: With dead ends: 396 [2024-11-10 15:10:06,185 INFO L226 Difference]: Without dead ends: 396 [2024-11-10 15:10:06,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:10:06,185 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 67 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:06,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 480 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-10 15:10:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 349. [2024-11-10 15:10:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 285 states have (on average 1.449122807017544) internal successors, (413), 336 states have internal predecessors, (413), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 431 transitions. [2024-11-10 15:10:06,191 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 431 transitions. Word has length 38 [2024-11-10 15:10:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:06,192 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 431 transitions. [2024-11-10 15:10:06,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 431 transitions. [2024-11-10 15:10:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:10:06,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:06,192 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-10 15:10:06,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 15:10:06,192 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 777829432, now seen corresponding path program 1 times [2024-11-10 15:10:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889255371] [2024-11-10 15:10:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:06,341 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-10 15:10:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889255371] [2024-11-10 15:10:06,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889255371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:06,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:06,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:06,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639686734] [2024-11-10 15:10:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:06,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:06,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:06,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:06,342 INFO L87 Difference]: Start difference. First operand 349 states and 431 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:06,657 INFO L93 Difference]: Finished difference Result 395 states and 486 transitions. [2024-11-10 15:10:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-10 15:10:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:06,660 INFO L225 Difference]: With dead ends: 395 [2024-11-10 15:10:06,660 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 15:10:06,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:10:06,660 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 305 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:06,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 471 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 15:10:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 348. [2024-11-10 15:10:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 285 states have (on average 1.4421052631578948) internal successors, (411), 335 states have internal predecessors, (411), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 429 transitions. [2024-11-10 15:10:06,666 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 429 transitions. Word has length 38 [2024-11-10 15:10:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:06,666 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 429 transitions. [2024-11-10 15:10:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 429 transitions. [2024-11-10 15:10:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:10:06,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:06,667 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-10 15:10:06,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 15:10:06,667 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:06,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 777829460, now seen corresponding path program 1 times [2024-11-10 15:10:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964846689] [2024-11-10 15:10:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:06,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:06,882 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-10 15:10:06,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:06,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964846689] [2024-11-10 15:10:06,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964846689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:06,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:06,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:10:06,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368616697] [2024-11-10 15:10:06,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:06,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:10:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:06,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:10:06,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:10:06,884 INFO L87 Difference]: Start difference. First operand 348 states and 429 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:07,281 INFO L93 Difference]: Finished difference Result 408 states and 461 transitions. [2024-11-10 15:10:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:10:07,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-10 15:10:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:07,282 INFO L225 Difference]: With dead ends: 408 [2024-11-10 15:10:07,282 INFO L226 Difference]: Without dead ends: 408 [2024-11-10 15:10:07,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:07,284 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 177 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:07,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 395 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-10 15:10:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 348. [2024-11-10 15:10:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 285 states have (on average 1.4350877192982456) internal successors, (409), 335 states have internal predecessors, (409), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 427 transitions. [2024-11-10 15:10:07,291 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 427 transitions. Word has length 38 [2024-11-10 15:10:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:07,291 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 427 transitions. [2024-11-10 15:10:07,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 427 transitions. [2024-11-10 15:10:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:10:07,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:07,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:07,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 15:10:07,292 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:07,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 29843447, now seen corresponding path program 1 times [2024-11-10 15:10:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822402836] [2024-11-10 15:10:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:07,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:07,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822402836] [2024-11-10 15:10:07,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822402836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:07,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442998350] [2024-11-10 15:10:07,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:07,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:07,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:07,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:07,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:07,434 INFO L87 Difference]: Start difference. First operand 348 states and 427 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:07,542 INFO L93 Difference]: Finished difference Result 352 states and 431 transitions. [2024-11-10 15:10:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:10:07,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-10 15:10:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:07,543 INFO L225 Difference]: With dead ends: 352 [2024-11-10 15:10:07,543 INFO L226 Difference]: Without dead ends: 352 [2024-11-10 15:10:07,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:07,544 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 141 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:07,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 349 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-10 15:10:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 349. [2024-11-10 15:10:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 287 states have (on average 1.4320557491289199) internal successors, (411), 336 states have internal predecessors, (411), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 429 transitions. [2024-11-10 15:10:07,548 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 429 transitions. Word has length 49 [2024-11-10 15:10:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:07,548 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 429 transitions. [2024-11-10 15:10:07,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 429 transitions. [2024-11-10 15:10:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:10:07,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:07,549 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:07,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 15:10:07,549 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:07,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 29843478, now seen corresponding path program 1 times [2024-11-10 15:10:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:07,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618094334] [2024-11-10 15:10:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:07,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:07,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618094334] [2024-11-10 15:10:07,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618094334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:07,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:07,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:07,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071705322] [2024-11-10 15:10:07,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:07,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:07,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:07,713 INFO L87 Difference]: Start difference. First operand 349 states and 429 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:07,815 INFO L93 Difference]: Finished difference Result 351 states and 429 transitions. [2024-11-10 15:10:07,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:10:07,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-10 15:10:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:07,816 INFO L225 Difference]: With dead ends: 351 [2024-11-10 15:10:07,816 INFO L226 Difference]: Without dead ends: 351 [2024-11-10 15:10:07,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:07,817 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 236 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:07,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 316 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-10 15:10:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2024-11-10 15:10:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 285 states have (on average 1.424561403508772) internal successors, (406), 333 states have internal predecessors, (406), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 424 transitions. [2024-11-10 15:10:07,821 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 424 transitions. Word has length 49 [2024-11-10 15:10:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:07,821 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 424 transitions. [2024-11-10 15:10:07,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 424 transitions. [2024-11-10 15:10:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:10:07,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:07,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:07,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 15:10:07,822 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:07,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -988573579, now seen corresponding path program 1 times [2024-11-10 15:10:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060263146] [2024-11-10 15:10:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:07,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 15:10:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:10:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060263146] [2024-11-10 15:10:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060263146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:07,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:07,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808809603] [2024-11-10 15:10:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:07,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:07,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:07,982 INFO L87 Difference]: Start difference. First operand 346 states and 424 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:08,171 INFO L93 Difference]: Finished difference Result 348 states and 424 transitions. [2024-11-10 15:10:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:10:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2024-11-10 15:10:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:08,173 INFO L225 Difference]: With dead ends: 348 [2024-11-10 15:10:08,173 INFO L226 Difference]: Without dead ends: 348 [2024-11-10 15:10:08,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:08,173 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 278 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:08,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 351 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:10:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-10 15:10:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2024-11-10 15:10:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 285 states have (on average 1.4105263157894736) internal successors, (402), 331 states have internal predecessors, (402), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 15:10:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 420 transitions. [2024-11-10 15:10:08,178 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 420 transitions. Word has length 51 [2024-11-10 15:10:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:08,178 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 420 transitions. [2024-11-10 15:10:08,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 420 transitions. [2024-11-10 15:10:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:10:08,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:08,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:08,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 15:10:08,179 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:08,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 243798992, now seen corresponding path program 1 times [2024-11-10 15:10:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504897667] [2024-11-10 15:10:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:08,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:08,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:08,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504897667] [2024-11-10 15:10:08,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504897667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:08,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:08,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:10:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823385447] [2024-11-10 15:10:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:08,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:10:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:08,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:10:08,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:08,466 INFO L87 Difference]: Start difference. First operand 344 states and 420 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:08,847 INFO L93 Difference]: Finished difference Result 715 states and 884 transitions. [2024-11-10 15:10:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:10:08,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2024-11-10 15:10:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:08,849 INFO L225 Difference]: With dead ends: 715 [2024-11-10 15:10:08,849 INFO L226 Difference]: Without dead ends: 715 [2024-11-10 15:10:08,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:10:08,850 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 412 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:08,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1076 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-10 15:10:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 494. [2024-11-10 15:10:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 428 states have (on average 1.3925233644859814) internal successors, (596), 477 states have internal predecessors, (596), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 626 transitions. [2024-11-10 15:10:08,858 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 626 transitions. Word has length 53 [2024-11-10 15:10:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:08,858 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 626 transitions. [2024-11-10 15:10:08,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 626 transitions. [2024-11-10 15:10:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:10:08,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:08,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:08,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 15:10:08,860 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:08,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 243798993, now seen corresponding path program 1 times [2024-11-10 15:10:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306030569] [2024-11-10 15:10:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306030569] [2024-11-10 15:10:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306030569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:10:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681812213] [2024-11-10 15:10:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:09,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:09,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:09,644 INFO L87 Difference]: Start difference. First operand 494 states and 626 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:10,099 INFO L93 Difference]: Finished difference Result 523 states and 656 transitions. [2024-11-10 15:10:10,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:10:10,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2024-11-10 15:10:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:10,101 INFO L225 Difference]: With dead ends: 523 [2024-11-10 15:10:10,101 INFO L226 Difference]: Without dead ends: 523 [2024-11-10 15:10:10,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:10:10,102 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 77 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:10,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1029 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-10 15:10:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 514. [2024-11-10 15:10:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 448 states have (on average 1.3772321428571428) internal successors, (617), 497 states have internal predecessors, (617), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 647 transitions. [2024-11-10 15:10:10,114 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 647 transitions. Word has length 53 [2024-11-10 15:10:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:10,114 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 647 transitions. [2024-11-10 15:10:10,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 647 transitions. [2024-11-10 15:10:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:10:10,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:10,115 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:10,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 15:10:10,115 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:10,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash 993261244, now seen corresponding path program 1 times [2024-11-10 15:10:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534031423] [2024-11-10 15:10:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:10,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534031423] [2024-11-10 15:10:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534031423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:10:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756347946] [2024-11-10 15:10:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:10:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:10:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:10,595 INFO L87 Difference]: Start difference. First operand 514 states and 647 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:11,049 INFO L93 Difference]: Finished difference Result 797 states and 990 transitions. [2024-11-10 15:10:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:10:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-10 15:10:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:11,052 INFO L225 Difference]: With dead ends: 797 [2024-11-10 15:10:11,052 INFO L226 Difference]: Without dead ends: 797 [2024-11-10 15:10:11,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:10:11,052 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 417 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:11,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1247 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-10 15:10:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 518. [2024-11-10 15:10:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 452 states have (on average 1.3738938053097345) internal successors, (621), 501 states have internal predecessors, (621), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 651 transitions. [2024-11-10 15:10:11,059 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 651 transitions. Word has length 54 [2024-11-10 15:10:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:11,060 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 651 transitions. [2024-11-10 15:10:11,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 651 transitions. [2024-11-10 15:10:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:10:11,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:11,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:11,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 15:10:11,061 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:11,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash 993261245, now seen corresponding path program 1 times [2024-11-10 15:10:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:11,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381049519] [2024-11-10 15:10:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381049519] [2024-11-10 15:10:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381049519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:11,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 15:10:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523353938] [2024-11-10 15:10:11,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:11,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:10:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:11,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:10:11,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:10:11,569 INFO L87 Difference]: Start difference. First operand 518 states and 651 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:12,121 INFO L93 Difference]: Finished difference Result 589 states and 693 transitions. [2024-11-10 15:10:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:10:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-10 15:10:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:12,123 INFO L225 Difference]: With dead ends: 589 [2024-11-10 15:10:12,123 INFO L226 Difference]: Without dead ends: 589 [2024-11-10 15:10:12,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:10:12,123 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 264 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:12,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1203 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-10 15:10:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 521. [2024-11-10 15:10:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 455 states have (on average 1.3692307692307693) internal successors, (623), 504 states have internal predecessors, (623), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 653 transitions. [2024-11-10 15:10:12,132 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 653 transitions. Word has length 54 [2024-11-10 15:10:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:12,132 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 653 transitions. [2024-11-10 15:10:12,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 653 transitions. [2024-11-10 15:10:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:10:12,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:12,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:12,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 15:10:12,133 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:12,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1226746588, now seen corresponding path program 1 times [2024-11-10 15:10:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:12,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900273481] [2024-11-10 15:10:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900273481] [2024-11-10 15:10:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900273481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-10 15:10:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715868257] [2024-11-10 15:10:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:12,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:10:12,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:12,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:10:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:10:12,883 INFO L87 Difference]: Start difference. First operand 521 states and 653 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:13,562 INFO L93 Difference]: Finished difference Result 592 states and 698 transitions. [2024-11-10 15:10:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:10:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-10 15:10:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:13,563 INFO L225 Difference]: With dead ends: 592 [2024-11-10 15:10:13,564 INFO L226 Difference]: Without dead ends: 592 [2024-11-10 15:10:13,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2024-11-10 15:10:13,564 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 247 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:13,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1416 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:10:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-10 15:10:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 509. [2024-11-10 15:10:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 443 states have (on average 1.3792325056433408) internal successors, (611), 492 states have internal predecessors, (611), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 641 transitions. [2024-11-10 15:10:13,571 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 641 transitions. Word has length 54 [2024-11-10 15:10:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:13,571 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 641 transitions. [2024-11-10 15:10:13,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 641 transitions. [2024-11-10 15:10:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:13,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:13,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:13,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 15:10:13,572 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1269492074, now seen corresponding path program 1 times [2024-11-10 15:10:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:13,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598763398] [2024-11-10 15:10:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:14,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598763398] [2024-11-10 15:10:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598763398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 15:10:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803358303] [2024-11-10 15:10:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:14,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 15:10:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 15:10:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:10:14,112 INFO L87 Difference]: Start difference. First operand 509 states and 641 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:14,808 INFO L93 Difference]: Finished difference Result 815 states and 1010 transitions. [2024-11-10 15:10:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:10:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:14,813 INFO L225 Difference]: With dead ends: 815 [2024-11-10 15:10:14,813 INFO L226 Difference]: Without dead ends: 815 [2024-11-10 15:10:14,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:10:14,814 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 555 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:14,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1753 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:10:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-10 15:10:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 528. [2024-11-10 15:10:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 462 states have (on average 1.3636363636363635) internal successors, (630), 511 states have internal predecessors, (630), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-10 15:10:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 660 transitions. [2024-11-10 15:10:14,822 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 660 transitions. Word has length 55 [2024-11-10 15:10:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 660 transitions. [2024-11-10 15:10:14,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 660 transitions. [2024-11-10 15:10:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:14,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:14,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:14,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 15:10:14,824 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:14,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1269492075, now seen corresponding path program 1 times [2024-11-10 15:10:14,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:14,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585729808] [2024-11-10 15:10:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585729808] [2024-11-10 15:10:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585729808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 15:10:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845322433] [2024-11-10 15:10:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:10:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:10:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:10:15,511 INFO L87 Difference]: Start difference. First operand 528 states and 660 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:16,290 INFO L93 Difference]: Finished difference Result 787 states and 970 transitions. [2024-11-10 15:10:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:10:16,290 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:16,292 INFO L225 Difference]: With dead ends: 787 [2024-11-10 15:10:16,292 INFO L226 Difference]: Without dead ends: 787 [2024-11-10 15:10:16,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-10 15:10:16,293 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 482 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:16,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2042 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:10:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-10 15:10:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 585. [2024-11-10 15:10:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 515 states have (on average 1.3902912621359222) internal successors, (716), 566 states have internal predecessors, (716), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-10 15:10:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 752 transitions. [2024-11-10 15:10:16,300 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 752 transitions. Word has length 55 [2024-11-10 15:10:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:16,300 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 752 transitions. [2024-11-10 15:10:16,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 752 transitions. [2024-11-10 15:10:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:16,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:16,301 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:16,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 15:10:16,301 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1298121225, now seen corresponding path program 1 times [2024-11-10 15:10:16,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542304139] [2024-11-10 15:10:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:16,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542304139] [2024-11-10 15:10:16,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542304139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:16,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:16,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:10:16,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299380660] [2024-11-10 15:10:16,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:16,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:10:16,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:16,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:10:16,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:10:16,485 INFO L87 Difference]: Start difference. First operand 585 states and 752 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:16,791 INFO L93 Difference]: Finished difference Result 930 states and 1205 transitions. [2024-11-10 15:10:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:10:16,791 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:16,793 INFO L225 Difference]: With dead ends: 930 [2024-11-10 15:10:16,793 INFO L226 Difference]: Without dead ends: 930 [2024-11-10 15:10:16,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:10:16,794 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 183 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:16,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1019 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-11-10 15:10:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 699. [2024-11-10 15:10:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 613 states have (on average 1.3849918433931485) internal successors, (849), 672 states have internal predecessors, (849), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2024-11-10 15:10:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 909 transitions. [2024-11-10 15:10:16,803 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 909 transitions. Word has length 55 [2024-11-10 15:10:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:16,804 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 909 transitions. [2024-11-10 15:10:16,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 909 transitions. [2024-11-10 15:10:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:16,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:16,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 15:10:16,805 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1298121226, now seen corresponding path program 1 times [2024-11-10 15:10:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:16,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863188649] [2024-11-10 15:10:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863188649] [2024-11-10 15:10:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863188649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213737098] [2024-11-10 15:10:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:17,964 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-10 15:10:17,964 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-10 15:10:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:18,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 15:10:18,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:18,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:10:18,645 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 19 treesize of output 1 [2024-11-10 15:10:18,649 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 13 treesize of output 9 [2024-11-10 15:10:18,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:18,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 15:10:18,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:18,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-10 15:10:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:19,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213737098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:10:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 29 [2024-11-10 15:10:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072829014] [2024-11-10 15:10:19,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:19,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:10:19,059 INFO L87 Difference]: Start difference. First operand 699 states and 909 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:19,666 INFO L93 Difference]: Finished difference Result 1136 states and 1491 transitions. [2024-11-10 15:10:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:10:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:19,670 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 15:10:19,670 INFO L226 Difference]: Without dead ends: 1136 [2024-11-10 15:10:19,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 15:10:19,670 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 383 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:19,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1235 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:10:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-10 15:10:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 919. [2024-11-10 15:10:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 809 states have (on average 1.415327564894932) internal successors, (1145), 880 states have internal predecessors, (1145), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2024-11-10 15:10:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1241 transitions. [2024-11-10 15:10:19,691 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1241 transitions. Word has length 55 [2024-11-10 15:10:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:19,691 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1241 transitions. [2024-11-10 15:10:19,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1241 transitions. [2024-11-10 15:10:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:19,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:19,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:19,722 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-10 15:10:19,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-11-10 15:10:19,893 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:19,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash -167773042, now seen corresponding path program 1 times [2024-11-10 15:10:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150475433] [2024-11-10 15:10:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:20,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:20,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150475433] [2024-11-10 15:10:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150475433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:20,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:10:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422049170] [2024-11-10 15:10:20,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:20,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:10:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:10:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:20,159 INFO L87 Difference]: Start difference. First operand 919 states and 1241 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:20,506 INFO L93 Difference]: Finished difference Result 1295 states and 1752 transitions. [2024-11-10 15:10:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:10:20,506 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:20,509 INFO L225 Difference]: With dead ends: 1295 [2024-11-10 15:10:20,509 INFO L226 Difference]: Without dead ends: 1295 [2024-11-10 15:10:20,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:10:20,510 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 479 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:20,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 950 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-10 15:10:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 973. [2024-11-10 15:10:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 855 states have (on average 1.4116959064327486) internal successors, (1207), 930 states have internal predecessors, (1207), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-11-10 15:10:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1315 transitions. [2024-11-10 15:10:20,521 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1315 transitions. Word has length 55 [2024-11-10 15:10:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:20,521 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1315 transitions. [2024-11-10 15:10:20,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1315 transitions. [2024-11-10 15:10:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:20,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:20,522 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-10 15:10:20,522 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:20,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash -167773041, now seen corresponding path program 1 times [2024-11-10 15:10:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636013467] [2024-11-10 15:10:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636013467] [2024-11-10 15:10:20,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636013467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:20,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:10:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082746748] [2024-11-10 15:10:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:20,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:20,830 INFO L87 Difference]: Start difference. First operand 973 states and 1315 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:21,229 INFO L93 Difference]: Finished difference Result 1354 states and 1819 transitions. [2024-11-10 15:10:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:10:21,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:21,233 INFO L225 Difference]: With dead ends: 1354 [2024-11-10 15:10:21,233 INFO L226 Difference]: Without dead ends: 1354 [2024-11-10 15:10:21,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:10:21,234 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 320 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:21,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1241 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-11-10 15:10:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 790. [2024-11-10 15:10:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 692 states have (on average 1.4132947976878614) internal successors, (978), 757 states have internal predecessors, (978), 26 states have call successors, (26), 13 states have call predecessors, (26), 26 states have return successors, (52), 19 states have call predecessors, (52), 26 states have call successors, (52) [2024-11-10 15:10:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1056 transitions. [2024-11-10 15:10:21,245 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1056 transitions. Word has length 55 [2024-11-10 15:10:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:21,245 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1056 transitions. [2024-11-10 15:10:21,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1056 transitions. [2024-11-10 15:10:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:21,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:21,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:21,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-10 15:10:21,246 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -139143891, now seen corresponding path program 1 times [2024-11-10 15:10:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:21,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074054083] [2024-11-10 15:10:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074054083] [2024-11-10 15:10:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074054083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114421293] [2024-11-10 15:10:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:21,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:21,634 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-10 15:10:21,635 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-10 15:10:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:21,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 15:10:21,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:21,800 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-10 15:10:22,053 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 19 treesize of output 1 [2024-11-10 15:10:22,103 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 15 [2024-11-10 15:10:22,172 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 21 treesize of output 9 [2024-11-10 15:10:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:22,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:22,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114421293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:22,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:10:22,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-11-10 15:10:22,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460042808] [2024-11-10 15:10:22,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:22,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:22,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:22,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:10:22,178 INFO L87 Difference]: Start difference. First operand 790 states and 1056 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:22,775 INFO L93 Difference]: Finished difference Result 1243 states and 1645 transitions. [2024-11-10 15:10:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:10:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:22,778 INFO L225 Difference]: With dead ends: 1243 [2024-11-10 15:10:22,778 INFO L226 Difference]: Without dead ends: 1243 [2024-11-10 15:10:22,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2024-11-10 15:10:22,779 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 328 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:22,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1914 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:10:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-10 15:10:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 861. [2024-11-10 15:10:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 763 states have (on average 1.4076015727391875) internal successors, (1074), 828 states have internal predecessors, (1074), 26 states have call successors, (26), 13 states have call predecessors, (26), 26 states have return successors, (52), 19 states have call predecessors, (52), 26 states have call successors, (52) [2024-11-10 15:10:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1152 transitions. [2024-11-10 15:10:22,791 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1152 transitions. Word has length 55 [2024-11-10 15:10:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:22,791 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1152 transitions. [2024-11-10 15:10:22,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1152 transitions. [2024-11-10 15:10:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:10:22,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:22,792 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:22,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 15:10:22,992 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,SelfDestructingSolverStorable46 [2024-11-10 15:10:22,992 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:22,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash -139143890, now seen corresponding path program 1 times [2024-11-10 15:10:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601995705] [2024-11-10 15:10:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601995705] [2024-11-10 15:10:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601995705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415368743] [2024-11-10 15:10:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:23,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:23,521 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-10 15:10:23,522 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-10 15:10:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:23,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-10 15:10:23,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:23,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:10:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:10:24,049 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-10 15:10:24,121 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-10 15:10:24,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:10:24,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:10:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:24,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:24,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415368743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:10:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 23 [2024-11-10 15:10:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717600044] [2024-11-10 15:10:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:24,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-10 15:10:24,292 INFO L87 Difference]: Start difference. First operand 861 states and 1152 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:24,985 INFO L93 Difference]: Finished difference Result 1319 states and 1752 transitions. [2024-11-10 15:10:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:10:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-10 15:10:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:24,989 INFO L225 Difference]: With dead ends: 1319 [2024-11-10 15:10:24,989 INFO L226 Difference]: Without dead ends: 1319 [2024-11-10 15:10:24,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2024-11-10 15:10:24,990 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 333 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:24,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 2272 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:10:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-11-10 15:10:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 965. [2024-11-10 15:10:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 855 states have (on average 1.4187134502923977) internal successors, (1213), 926 states have internal predecessors, (1213), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2024-11-10 15:10:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1309 transitions. [2024-11-10 15:10:25,002 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1309 transitions. Word has length 55 [2024-11-10 15:10:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:25,002 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1309 transitions. [2024-11-10 15:10:25,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1309 transitions. [2024-11-10 15:10:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:10:25,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:25,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:25,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:10:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:25,208 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash 211131872, now seen corresponding path program 1 times [2024-11-10 15:10:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480001704] [2024-11-10 15:10:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:25,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480001704] [2024-11-10 15:10:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480001704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 15:10:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643939931] [2024-11-10 15:10:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:25,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:10:25,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:10:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:10:25,620 INFO L87 Difference]: Start difference. First operand 965 states and 1309 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:26,105 INFO L93 Difference]: Finished difference Result 1432 states and 1920 transitions. [2024-11-10 15:10:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:10:26,106 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-11-10 15:10:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:26,109 INFO L225 Difference]: With dead ends: 1432 [2024-11-10 15:10:26,109 INFO L226 Difference]: Without dead ends: 1432 [2024-11-10 15:10:26,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-10 15:10:26,110 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 429 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:26,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1973 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2024-11-10 15:10:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1190. [2024-11-10 15:10:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1056 states have (on average 1.4327651515151516) internal successors, (1513), 1139 states have internal predecessors, (1513), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-11-10 15:10:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1645 transitions. [2024-11-10 15:10:26,128 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1645 transitions. Word has length 57 [2024-11-10 15:10:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:26,128 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1645 transitions. [2024-11-10 15:10:26,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1645 transitions. [2024-11-10 15:10:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:10:26,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:26,129 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:26,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-10 15:10:26,129 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:26,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1953942207, now seen corresponding path program 1 times [2024-11-10 15:10:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:26,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277901464] [2024-11-10 15:10:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:26,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:26,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277901464] [2024-11-10 15:10:26,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277901464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:26,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:26,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:10:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834025336] [2024-11-10 15:10:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:26,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:10:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:10:26,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:10:26,364 INFO L87 Difference]: Start difference. First operand 1190 states and 1645 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:26,587 INFO L93 Difference]: Finished difference Result 1647 states and 2267 transitions. [2024-11-10 15:10:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:10:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-11-10 15:10:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:26,592 INFO L225 Difference]: With dead ends: 1647 [2024-11-10 15:10:26,593 INFO L226 Difference]: Without dead ends: 1647 [2024-11-10 15:10:26,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:26,593 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 170 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:26,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1506 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-11-10 15:10:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1398. [2024-11-10 15:10:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1244 states have (on average 1.454983922829582) internal successors, (1810), 1337 states have internal predecessors, (1810), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 33 states have call predecessors, (108), 54 states have call successors, (108) [2024-11-10 15:10:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1972 transitions. [2024-11-10 15:10:26,617 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1972 transitions. Word has length 57 [2024-11-10 15:10:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:26,618 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1972 transitions. [2024-11-10 15:10:26,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1972 transitions. [2024-11-10 15:10:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:10:26,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:26,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:26,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-10 15:10:26,619 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1801889175, now seen corresponding path program 1 times [2024-11-10 15:10:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826506869] [2024-11-10 15:10:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 15:10:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:10:26,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:26,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826506869] [2024-11-10 15:10:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826506869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:10:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805171600] [2024-11-10 15:10:26,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:10:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:10:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:10:26,685 INFO L87 Difference]: Start difference. First operand 1398 states and 1972 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:10:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:26,704 INFO L93 Difference]: Finished difference Result 1415 states and 1972 transitions. [2024-11-10 15:10:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:10:26,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2024-11-10 15:10:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:26,707 INFO L225 Difference]: With dead ends: 1415 [2024-11-10 15:10:26,707 INFO L226 Difference]: Without dead ends: 1415 [2024-11-10 15:10:26,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:26,707 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 133 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:26,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 476 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:10:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-10 15:10:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1397. [2024-11-10 15:10:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1244 states have (on average 1.4405144694533762) internal successors, (1792), 1336 states have internal predecessors, (1792), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 33 states have call predecessors, (108), 54 states have call successors, (108) [2024-11-10 15:10:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1954 transitions. [2024-11-10 15:10:26,726 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1954 transitions. Word has length 58 [2024-11-10 15:10:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:26,726 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1954 transitions. [2024-11-10 15:10:26,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:10:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1954 transitions. [2024-11-10 15:10:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:10:26,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:26,728 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:26,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-10 15:10:26,728 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:26,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1978824708, now seen corresponding path program 1 times [2024-11-10 15:10:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:26,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924988695] [2024-11-10 15:10:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924988695] [2024-11-10 15:10:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924988695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:27,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838966665] [2024-11-10 15:10:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:27,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:27,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:27,324 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-10 15:10:27,325 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-10 15:10:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:27,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 15:10:27,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:27,824 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 13 treesize of output 9 [2024-11-10 15:10:27,829 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 13 treesize of output 9 [2024-11-10 15:10:27,959 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 17 treesize of output 17 [2024-11-10 15:10:27,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:10:28,011 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 9 treesize of output 3 [2024-11-10 15:10:28,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:28,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:28,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-10 15:10:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:28,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838966665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:10:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 29 [2024-11-10 15:10:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707034868] [2024-11-10 15:10:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:28,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 15:10:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:28,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 15:10:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2024-11-10 15:10:28,247 INFO L87 Difference]: Start difference. First operand 1397 states and 1954 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:29,337 INFO L93 Difference]: Finished difference Result 1645 states and 2238 transitions. [2024-11-10 15:10:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:10:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-11-10 15:10:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:29,343 INFO L225 Difference]: With dead ends: 1645 [2024-11-10 15:10:29,343 INFO L226 Difference]: Without dead ends: 1645 [2024-11-10 15:10:29,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 15:10:29,345 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 320 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:29,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 3782 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1373 Invalid, 5 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 15:10:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-10 15:10:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1397. [2024-11-10 15:10:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1244 states have (on average 1.4405144694533762) internal successors, (1792), 1336 states have internal predecessors, (1792), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 33 states have call predecessors, (108), 54 states have call successors, (108) [2024-11-10 15:10:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1954 transitions. [2024-11-10 15:10:29,361 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1954 transitions. Word has length 57 [2024-11-10 15:10:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:29,361 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1954 transitions. [2024-11-10 15:10:29,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1954 transitions. [2024-11-10 15:10:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:10:29,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:29,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:29,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:10:29,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:29,567 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:29,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash -573332253, now seen corresponding path program 1 times [2024-11-10 15:10:29,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:29,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732034873] [2024-11-10 15:10:29,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:29,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732034873] [2024-11-10 15:10:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732034873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:10:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773061204] [2024-11-10 15:10:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:10:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:10:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:29,735 INFO L87 Difference]: Start difference. First operand 1397 states and 1954 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:29,987 INFO L93 Difference]: Finished difference Result 1682 states and 2309 transitions. [2024-11-10 15:10:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:10:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-11-10 15:10:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:29,990 INFO L225 Difference]: With dead ends: 1682 [2024-11-10 15:10:29,990 INFO L226 Difference]: Without dead ends: 1682 [2024-11-10 15:10:29,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:29,991 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 152 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:29,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1489 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-10 15:10:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1237. [2024-11-10 15:10:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1100 states have (on average 1.4263636363636363) internal successors, (1569), 1184 states have internal predecessors, (1569), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2024-11-10 15:10:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1707 transitions. [2024-11-10 15:10:30,010 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1707 transitions. Word has length 57 [2024-11-10 15:10:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:30,011 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1707 transitions. [2024-11-10 15:10:30,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1707 transitions. [2024-11-10 15:10:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:10:30,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:30,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:30,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-10 15:10:30,012 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2043645017, now seen corresponding path program 1 times [2024-11-10 15:10:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009677621] [2024-11-10 15:10:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:30,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:30,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009677621] [2024-11-10 15:10:30,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009677621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:30,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:30,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 15:10:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314966794] [2024-11-10 15:10:30,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:30,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 15:10:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 15:10:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:10:30,492 INFO L87 Difference]: Start difference. First operand 1237 states and 1707 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:30,924 INFO L93 Difference]: Finished difference Result 1708 states and 2319 transitions. [2024-11-10 15:10:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:10:30,924 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-10 15:10:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:30,927 INFO L225 Difference]: With dead ends: 1708 [2024-11-10 15:10:30,927 INFO L226 Difference]: Without dead ends: 1708 [2024-11-10 15:10:30,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2024-11-10 15:10:30,928 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 457 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:30,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1304 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2024-11-10 15:10:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1468. [2024-11-10 15:10:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1307 states have (on average 1.433052792654935) internal successors, (1873), 1403 states have internal predecessors, (1873), 58 states have call successors, (58), 29 states have call predecessors, (58), 58 states have return successors, (116), 35 states have call predecessors, (116), 58 states have call successors, (116) [2024-11-10 15:10:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2047 transitions. [2024-11-10 15:10:30,943 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2047 transitions. Word has length 58 [2024-11-10 15:10:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:30,943 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 2047 transitions. [2024-11-10 15:10:30,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2047 transitions. [2024-11-10 15:10:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:10:30,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:30,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:30,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-10 15:10:30,944 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:30,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash 443867816, now seen corresponding path program 1 times [2024-11-10 15:10:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801208513] [2024-11-10 15:10:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801208513] [2024-11-10 15:10:31,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801208513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:31,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:10:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993965258] [2024-11-10 15:10:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:31,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:10:31,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:10:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:10:31,115 INFO L87 Difference]: Start difference. First operand 1468 states and 2047 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:31,364 INFO L93 Difference]: Finished difference Result 1832 states and 2525 transitions. [2024-11-10 15:10:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:10:31,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-10 15:10:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:31,367 INFO L225 Difference]: With dead ends: 1832 [2024-11-10 15:10:31,367 INFO L226 Difference]: Without dead ends: 1832 [2024-11-10 15:10:31,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:31,367 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 168 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:31,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1049 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-10 15:10:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1575. [2024-11-10 15:10:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1406 states have (on average 1.4466571834992887) internal successors, (2034), 1506 states have internal predecessors, (2034), 62 states have call successors, (62), 31 states have call predecessors, (62), 62 states have return successors, (124), 37 states have call predecessors, (124), 62 states have call successors, (124) [2024-11-10 15:10:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2220 transitions. [2024-11-10 15:10:31,403 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2220 transitions. Word has length 58 [2024-11-10 15:10:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:31,403 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2220 transitions. [2024-11-10 15:10:31,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2220 transitions. [2024-11-10 15:10:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:10:31,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:31,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:31,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-10 15:10:31,405 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 23989639, now seen corresponding path program 1 times [2024-11-10 15:10:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902372830] [2024-11-10 15:10:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 15:10:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:10:31,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902372830] [2024-11-10 15:10:31,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902372830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811333081] [2024-11-10 15:10:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:31,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:31,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:31,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:10:31,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:10:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:32,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 15:10:32,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:32,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:10:32,283 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 19 [2024-11-10 15:10:32,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:32,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:32,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2024-11-10 15:10:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:32,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:32,914 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 74 treesize of output 70 [2024-11-10 15:10:32,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:32,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:32,931 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 22 treesize of output 18 [2024-11-10 15:10:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:10:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811333081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:10:33,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:10:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 38 [2024-11-10 15:10:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993260203] [2024-11-10 15:10:33,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:33,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 15:10:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 15:10:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 15:10:33,187 INFO L87 Difference]: Start difference. First operand 1575 states and 2220 transitions. Second operand has 38 states, 38 states have (on average 3.8684210526315788) internal successors, (147), 38 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:10:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:34,118 INFO L93 Difference]: Finished difference Result 1788 states and 2465 transitions. [2024-11-10 15:10:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:10:34,118 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.8684210526315788) internal successors, (147), 38 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 59 [2024-11-10 15:10:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:34,121 INFO L225 Difference]: With dead ends: 1788 [2024-11-10 15:10:34,121 INFO L226 Difference]: Without dead ends: 1788 [2024-11-10 15:10:34,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=2213, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 15:10:34,122 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 576 mSDsluCounter, 3533 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 3704 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:34,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 3704 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:10:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2024-11-10 15:10:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1561. [2024-11-10 15:10:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1392 states have (on average 1.4425287356321839) internal successors, (2008), 1492 states have internal predecessors, (2008), 62 states have call successors, (62), 31 states have call predecessors, (62), 62 states have return successors, (124), 37 states have call predecessors, (124), 62 states have call successors, (124) [2024-11-10 15:10:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2194 transitions. [2024-11-10 15:10:34,138 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2194 transitions. Word has length 59 [2024-11-10 15:10:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:34,139 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2194 transitions. [2024-11-10 15:10:34,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.8684210526315788) internal successors, (147), 38 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:10:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2194 transitions. [2024-11-10 15:10:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:10:34,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:34,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:34,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:10:34,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2024-11-10 15:10:34,343 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:34,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:34,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2030441780, now seen corresponding path program 1 times [2024-11-10 15:10:34,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:34,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045381863] [2024-11-10 15:10:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:34,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:34,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:34,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045381863] [2024-11-10 15:10:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045381863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:34,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:10:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345782083] [2024-11-10 15:10:34,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:34,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:10:34,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:10:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:10:34,731 INFO L87 Difference]: Start difference. First operand 1561 states and 2194 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:35,262 INFO L93 Difference]: Finished difference Result 1694 states and 2329 transitions. [2024-11-10 15:10:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:10:35,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-10 15:10:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:35,265 INFO L225 Difference]: With dead ends: 1694 [2024-11-10 15:10:35,265 INFO L226 Difference]: Without dead ends: 1694 [2024-11-10 15:10:35,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:10:35,265 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:35,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1137 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-11-10 15:10:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1561. [2024-11-10 15:10:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1392 states have (on average 1.4418103448275863) internal successors, (2007), 1492 states have internal predecessors, (2007), 62 states have call successors, (62), 31 states have call predecessors, (62), 62 states have return successors, (124), 37 states have call predecessors, (124), 62 states have call successors, (124) [2024-11-10 15:10:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2193 transitions. [2024-11-10 15:10:35,280 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2193 transitions. Word has length 58 [2024-11-10 15:10:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:35,280 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2193 transitions. [2024-11-10 15:10:35,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2193 transitions. [2024-11-10 15:10:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:10:35,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:35,281 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:35,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-10 15:10:35,282 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:35,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:35,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1215225347, now seen corresponding path program 1 times [2024-11-10 15:10:35,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:35,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191067794] [2024-11-10 15:10:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:35,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191067794] [2024-11-10 15:10:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191067794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:35,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:35,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:10:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702528227] [2024-11-10 15:10:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:35,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:35,551 INFO L87 Difference]: Start difference. First operand 1561 states and 2193 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:35,890 INFO L93 Difference]: Finished difference Result 1816 states and 2491 transitions. [2024-11-10 15:10:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:10:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-10 15:10:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:35,894 INFO L225 Difference]: With dead ends: 1816 [2024-11-10 15:10:35,894 INFO L226 Difference]: Without dead ends: 1816 [2024-11-10 15:10:35,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:10:35,895 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 381 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:35,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1113 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-10 15:10:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1448. [2024-11-10 15:10:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1291 states have (on average 1.4384198295894655) internal successors, (1857), 1385 states have internal predecessors, (1857), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 34 states have call predecessors, (112), 56 states have call successors, (112) [2024-11-10 15:10:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2025 transitions. [2024-11-10 15:10:35,909 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2025 transitions. Word has length 58 [2024-11-10 15:10:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:35,909 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 2025 transitions. [2024-11-10 15:10:35,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2025 transitions. [2024-11-10 15:10:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:10:35,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:35,910 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:35,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-10 15:10:35,910 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:35,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash -592229116, now seen corresponding path program 1 times [2024-11-10 15:10:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:35,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828460765] [2024-11-10 15:10:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:35,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828460765] [2024-11-10 15:10:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828460765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142886383] [2024-11-10 15:10:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:36,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:36,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:10:36,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:10:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:36,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 15:10:36,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:36,712 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 19 treesize of output 1 [2024-11-10 15:10:36,766 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 15 [2024-11-10 15:10:36,833 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 21 treesize of output 9 [2024-11-10 15:10:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:36,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:36,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142886383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:36,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:10:36,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2024-11-10 15:10:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871579403] [2024-11-10 15:10:36,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:36,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:36,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:36,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:10:36,843 INFO L87 Difference]: Start difference. First operand 1448 states and 2025 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:37,350 INFO L93 Difference]: Finished difference Result 1685 states and 2292 transitions. [2024-11-10 15:10:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:10:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-10 15:10:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:37,352 INFO L225 Difference]: With dead ends: 1685 [2024-11-10 15:10:37,352 INFO L226 Difference]: Without dead ends: 1685 [2024-11-10 15:10:37,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:10:37,353 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 327 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:37,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 2153 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-11-10 15:10:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1429. [2024-11-10 15:10:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1272 states have (on average 1.440251572327044) internal successors, (1832), 1366 states have internal predecessors, (1832), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 34 states have call predecessors, (112), 56 states have call successors, (112) [2024-11-10 15:10:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2000 transitions. [2024-11-10 15:10:37,366 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2000 transitions. Word has length 58 [2024-11-10 15:10:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:37,366 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2000 transitions. [2024-11-10 15:10:37,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2000 transitions. [2024-11-10 15:10:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:10:37,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:37,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:37,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:10:37,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2024-11-10 15:10:37,569 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2030244181, now seen corresponding path program 1 times [2024-11-10 15:10:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613949310] [2024-11-10 15:10:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:38,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 15:10:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:10:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613949310] [2024-11-10 15:10:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613949310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295065287] [2024-11-10 15:10:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:38,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:38,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:38,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:10:38,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:10:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:38,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-10 15:10:38,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:38,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:10:38,646 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 19 [2024-11-10 15:10:38,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:38,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:38,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2024-11-10 15:10:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:39,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:39,535 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 74 treesize of output 70 [2024-11-10 15:10:39,556 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 74 treesize of output 70 [2024-11-10 15:10:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:10:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295065287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:10:40,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:10:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2024-11-10 15:10:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283085364] [2024-11-10 15:10:40,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:40,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-10 15:10:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-10 15:10:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2029, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 15:10:40,207 INFO L87 Difference]: Start difference. First operand 1429 states and 2000 transitions. Second operand has 47 states, 47 states have (on average 3.3404255319148937) internal successors, (157), 44 states have internal predecessors, (157), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:10:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:42,264 INFO L93 Difference]: Finished difference Result 1732 states and 2369 transitions. [2024-11-10 15:10:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:10:42,264 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.3404255319148937) internal successors, (157), 44 states have internal predecessors, (157), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2024-11-10 15:10:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:42,267 INFO L225 Difference]: With dead ends: 1732 [2024-11-10 15:10:42,267 INFO L226 Difference]: Without dead ends: 1732 [2024-11-10 15:10:42,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=343, Invalid=3689, Unknown=0, NotChecked=0, Total=4032 [2024-11-10 15:10:42,268 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 489 mSDsluCounter, 8116 mSDsCounter, 0 mSdLazyCounter, 3159 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 8429 SdHoareTripleChecker+Invalid, 3171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:42,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 8429 Invalid, 3171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3159 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 15:10:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2024-11-10 15:10:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1331. [2024-11-10 15:10:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1186 states have (on average 1.436762225969646) internal successors, (1704), 1274 states have internal predecessors, (1704), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2024-11-10 15:10:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1854 transitions. [2024-11-10 15:10:42,279 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1854 transitions. Word has length 59 [2024-11-10 15:10:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:42,279 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1854 transitions. [2024-11-10 15:10:42,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.3404255319148937) internal successors, (157), 44 states have internal predecessors, (157), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:10:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1854 transitions. [2024-11-10 15:10:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:10:42,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:42,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:42,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:10:42,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:42,481 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:42,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash -933301756, now seen corresponding path program 1 times [2024-11-10 15:10:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52086427] [2024-11-10 15:10:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:42,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 15:10:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:10:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52086427] [2024-11-10 15:10:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52086427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586972112] [2024-11-10 15:10:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:42,968 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:10:42,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:10:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:43,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-10 15:10:43,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:43,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:10:43,307 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 22 [2024-11-10 15:10:43,410 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-10 15:10:43,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 20 [2024-11-10 15:10:43,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:43,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-10 15:10:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:43,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586972112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:43,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:10:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2024-11-10 15:10:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508362864] [2024-11-10 15:10:43,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:43,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:10:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:10:43,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-10 15:10:43,582 INFO L87 Difference]: Start difference. First operand 1331 states and 1854 transitions. Second operand has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 21 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:10:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:44,793 INFO L93 Difference]: Finished difference Result 1890 states and 2567 transitions. [2024-11-10 15:10:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:10:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 21 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2024-11-10 15:10:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:44,796 INFO L225 Difference]: With dead ends: 1890 [2024-11-10 15:10:44,796 INFO L226 Difference]: Without dead ends: 1890 [2024-11-10 15:10:44,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=1904, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 15:10:44,797 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1145 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:44,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2480 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 15:10:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-11-10 15:10:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1353. [2024-11-10 15:10:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1208 states have (on average 1.4346026490066226) internal successors, (1733), 1294 states have internal predecessors, (1733), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 33 states have call predecessors, (100), 50 states have call successors, (100) [2024-11-10 15:10:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1883 transitions. [2024-11-10 15:10:44,810 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1883 transitions. Word has length 60 [2024-11-10 15:10:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:44,810 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1883 transitions. [2024-11-10 15:10:44,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 21 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:10:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1883 transitions. [2024-11-10 15:10:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:10:44,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:44,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:44,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:10:45,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2024-11-10 15:10:45,014 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:45,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash -933301755, now seen corresponding path program 1 times [2024-11-10 15:10:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118855044] [2024-11-10 15:10:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:45,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:45,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:45,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 15:10:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:10:45,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:45,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118855044] [2024-11-10 15:10:45,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118855044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:45,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180122573] [2024-11-10 15:10:45,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:45,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:45,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:45,766 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:10:45,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:10:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:45,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-10 15:10:45,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:45,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:10:46,246 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-10 15:10:46,250 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-10 15:10:46,311 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-10 15:10:46,316 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 36 treesize of output 27 [2024-11-10 15:10:46,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:46,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-10 15:10:46,519 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 15:10:46,519 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 15 treesize of output 15 [2024-11-10 15:10:46,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-10 15:10:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:46,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:46,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180122573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:46,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:10:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 33 [2024-11-10 15:10:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220391985] [2024-11-10 15:10:46,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:46,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 15:10:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 15:10:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1359, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 15:10:46,881 INFO L87 Difference]: Start difference. First operand 1353 states and 1883 transitions. Second operand has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 32 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:10:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:49,865 INFO L93 Difference]: Finished difference Result 2276 states and 3052 transitions. [2024-11-10 15:10:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-10 15:10:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 32 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2024-11-10 15:10:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:49,868 INFO L225 Difference]: With dead ends: 2276 [2024-11-10 15:10:49,868 INFO L226 Difference]: Without dead ends: 2276 [2024-11-10 15:10:49,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=772, Invalid=6034, Unknown=0, NotChecked=0, Total=6806 [2024-11-10 15:10:49,869 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1183 mSDsluCounter, 3745 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:49,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 3906 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2996 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 15:10:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2024-11-10 15:10:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1575. [2024-11-10 15:10:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1406 states have (on average 1.4359886201991465) internal successors, (2019), 1501 states have internal predecessors, (2019), 62 states have call successors, (62), 31 states have call predecessors, (62), 62 states have return successors, (124), 42 states have call predecessors, (124), 62 states have call successors, (124) [2024-11-10 15:10:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2205 transitions. [2024-11-10 15:10:49,906 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2205 transitions. Word has length 60 [2024-11-10 15:10:49,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:49,906 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2205 transitions. [2024-11-10 15:10:49,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 32 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:10:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2205 transitions. [2024-11-10 15:10:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:10:49,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:49,907 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:49,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:10:50,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:50,109 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2024-11-10 15:10:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -190040735, now seen corresponding path program 1 times [2024-11-10 15:10:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:10:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102477268] [2024-11-10 15:10:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:10:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:10:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 15:10:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:10:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:10:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102477268] [2024-11-10 15:10:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102477268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:50,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147503705] [2024-11-10 15:10:50,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:50,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:10:50,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:10:50,600 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:10:50,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:10:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:50,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-10 15:10:50,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:50,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:10:51,118 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 13 treesize of output 9 [2024-11-10 15:10:51,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:51,267 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 40 treesize of output 27 [2024-11-10 15:10:51,279 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-10 15:10:51,425 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-10 15:10:51,426 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 20 treesize of output 20 [2024-11-10 15:10:51,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2024-11-10 15:10:51,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2024-11-10 15:10:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:51,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:51,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147503705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:51,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:10:51,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 28 [2024-11-10 15:10:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488737104] [2024-11-10 15:10:51,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:51,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:10:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:10:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:10:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 15:10:51,933 INFO L87 Difference]: Start difference. First operand 1575 states and 2205 transitions. Second operand has 29 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 27 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:10:57,561 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-10 15:11:09,726 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-10 15:11:13,764 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-10 15:11:17,788 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]