./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0214.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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-0214.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 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:21:13,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:21:13,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:21:13,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:21:13,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:21:13,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:21:13,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:21:13,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:21:13,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:21:13,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:21:13,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:21:13,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:21:13,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:21:13,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:21:13,307 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:21:13,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:21:13,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:21:13,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:21:13,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:21:13,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:21:13,308 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:21:13,309 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:21:13,309 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:21:13,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:21:13,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:21:13,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:21:13,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:21:13,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:21:13,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:21:13,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:21:13,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:21:13,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:21:13,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:21:13,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:21:13,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:21:13,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:21:13,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:21:13,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:21:13,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:21:13,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:21:13,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:21:13,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:21:13,314 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 -> 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 [2024-11-12 13:21:13,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:21:13,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:21:13,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:21:13,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:21:13,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:21:13,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0214.i [2024-11-12 13:21:15,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:21:15,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:21:15,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0214.i [2024-11-12 13:21:15,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66434dcb/3ec1cc6885e8436391b4cfabd6197490/FLAG2b20ed960 [2024-11-12 13:21:15,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66434dcb/3ec1cc6885e8436391b4cfabd6197490 [2024-11-12 13:21:15,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:21:15,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:21:15,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:21:15,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:21:15,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:21:15,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:21:15" (1/1) ... [2024-11-12 13:21:15,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aaf8e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:15, skipping insertion in model container [2024-11-12 13:21:15,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:21:15" (1/1) ... [2024-11-12 13:21:15,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:21:16,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:21:16,037 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:21:16,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:21:16,129 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:21:16,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16 WrapperNode [2024-11-12 13:21:16,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:21:16,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:21:16,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:21:16,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:21:16,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,188 INFO L138 Inliner]: procedures = 181, calls = 42, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 176 [2024-11-12 13:21:16,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:21:16,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:21:16,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:21:16,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:21:16,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,236 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 18, 7]. 67 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 11 writes are split as follows [0, 6, 5]. [2024-11-12 13:21:16,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:21:16,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:21:16,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:21:16,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:21:16,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:21:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:16,299 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-12 13:21:16,303 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-12 13:21:16,347 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-11-12 13:21:16,348 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:21:16,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:21:16,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:21:16,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:21:16,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:21:16,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:21:16,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:21:16,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:21:16,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 13:21:16,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:21:16,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:21:16,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:21:16,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:21:16,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:21:16,474 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:21:16,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:21:16,918 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2024-11-12 13:21:16,918 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:21:16,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:21:16,940 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 13:21:16,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:21:16 BoogieIcfgContainer [2024-11-12 13:21:16,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:21:16,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:21:16,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:21:16,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:21:16,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:21:15" (1/3) ... [2024-11-12 13:21:16,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3d765f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:21:16, skipping insertion in model container [2024-11-12 13:21:16,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16" (2/3) ... [2024-11-12 13:21:16,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3d765f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:21:16, skipping insertion in model container [2024-11-12 13:21:16,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:21:16" (3/3) ... [2024-11-12 13:21:16,951 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0214.i [2024-11-12 13:21:16,965 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:21:16,965 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-11-12 13:21:17,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:21:17,024 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;@381e87eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:21:17,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2024-11-12 13:21:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 138 states have internal predecessors, (158), 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-12 13:21:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:21:17,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:17,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:21:17,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:17,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1072948778, now seen corresponding path program 1 times [2024-11-12 13:21:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415235385] [2024-11-12 13:21:17,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:17,178 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-12 13:21:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415235385] [2024-11-12 13:21:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415235385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:17,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:17,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167470951] [2024-11-12 13:21:17,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:17,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:21:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:21:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:21:17,211 INFO L87 Difference]: Start difference. First operand has 142 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 138 states have internal predecessors, (158), 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-12 13:21:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:17,231 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2024-11-12 13:21:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:21:17,233 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-12 13:21:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:17,239 INFO L225 Difference]: With dead ends: 142 [2024-11-12 13:21:17,239 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 13:21:17,240 INFO L434 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-12 13:21:17,243 INFO L435 NwaCegarLoop]: 157 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, 157 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-12 13:21:17,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 13:21:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-12 13:21:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 80 states have (on average 1.8875) internal successors, (151), 136 states have internal predecessors, (151), 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-12 13:21:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2024-11-12 13:21:17,294 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 6 [2024-11-12 13:21:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:17,294 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2024-11-12 13:21:17,295 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-12 13:21:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2024-11-12 13:21:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:17,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:17,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:17,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:21:17,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:17,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381875, now seen corresponding path program 1 times [2024-11-12 13:21:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390954206] [2024-11-12 13:21:17,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:17,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-12 13:21:17,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390954206] [2024-11-12 13:21:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390954206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 13:21:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639493176] [2024-11-12 13:21:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:17,447 INFO L87 Difference]: Start difference. First operand 140 states and 155 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-12 13:21:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:17,681 INFO L93 Difference]: Finished difference Result 271 states and 300 transitions. [2024-11-12 13:21:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:17,682 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-12 13:21:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:17,684 INFO L225 Difference]: With dead ends: 271 [2024-11-12 13:21:17,685 INFO L226 Difference]: Without dead ends: 271 [2024-11-12 13:21:17,685 INFO L434 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-12 13:21:17,688 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 136 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:17,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 195 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-12 13:21:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 189. [2024-11-12 13:21:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.8571428571428572) internal successors, (234), 182 states have internal predecessors, (234), 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-12 13:21:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 242 transitions. [2024-11-12 13:21:17,714 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 242 transitions. Word has length 7 [2024-11-12 13:21:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:17,714 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 242 transitions. [2024-11-12 13:21:17,715 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-12 13:21:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 242 transitions. [2024-11-12 13:21:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:17,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:17,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:17,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:21:17,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381874, now seen corresponding path program 1 times [2024-11-12 13:21:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409230068] [2024-11-12 13:21:17,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:17,892 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-12 13:21:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409230068] [2024-11-12 13:21:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409230068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498588237] [2024-11-12 13:21:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:17,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:17,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:17,896 INFO L87 Difference]: Start difference. First operand 189 states and 242 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-12 13:21:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:18,081 INFO L93 Difference]: Finished difference Result 319 states and 397 transitions. [2024-11-12 13:21:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:18,081 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-12 13:21:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:18,083 INFO L225 Difference]: With dead ends: 319 [2024-11-12 13:21:18,083 INFO L226 Difference]: Without dead ends: 319 [2024-11-12 13:21:18,084 INFO L434 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-12 13:21:18,089 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 106 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:18,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 328 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-12 13:21:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 262. [2024-11-12 13:21:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 193 states have (on average 1.8186528497409327) internal successors, (351), 251 states have internal predecessors, (351), 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-12 13:21:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 367 transitions. [2024-11-12 13:21:18,117 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 367 transitions. Word has length 7 [2024-11-12 13:21:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:18,117 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 367 transitions. [2024-11-12 13:21:18,118 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-12 13:21:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2024-11-12 13:21:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:18,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:18,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:18,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:21:18,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:18,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381812, now seen corresponding path program 1 times [2024-11-12 13:21:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013038154] [2024-11-12 13:21:18,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:18,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:18,266 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-12 13:21:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013038154] [2024-11-12 13:21:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013038154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638025966] [2024-11-12 13:21:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:18,268 INFO L87 Difference]: Start difference. First operand 262 states and 367 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-12 13:21:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:18,408 INFO L93 Difference]: Finished difference Result 318 states and 395 transitions. [2024-11-12 13:21:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:18,409 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-12 13:21:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:18,410 INFO L225 Difference]: With dead ends: 318 [2024-11-12 13:21:18,410 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 13:21:18,411 INFO L434 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-12 13:21:18,412 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:18,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 303 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 13:21:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 262. [2024-11-12 13:21:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 193 states have (on average 1.8186528497409327) internal successors, (351), 251 states have internal predecessors, (351), 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-12 13:21:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 367 transitions. [2024-11-12 13:21:18,437 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 367 transitions. Word has length 7 [2024-11-12 13:21:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:18,438 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 367 transitions. [2024-11-12 13:21:18,438 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-12 13:21:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2024-11-12 13:21:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:21:18,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:18,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:18,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:21:18,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:18,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash -251697362, now seen corresponding path program 1 times [2024-11-12 13:21:18,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:18,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621996828] [2024-11-12 13:21:18,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:18,659 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-12 13:21:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:18,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621996828] [2024-11-12 13:21:18,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621996828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:18,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:18,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047662191] [2024-11-12 13:21:18,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:18,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:18,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:18,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:18,664 INFO L87 Difference]: Start difference. First operand 262 states and 367 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 13:21:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:18,812 INFO L93 Difference]: Finished difference Result 400 states and 533 transitions. [2024-11-12 13:21:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:18,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-12 13:21:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:18,816 INFO L225 Difference]: With dead ends: 400 [2024-11-12 13:21:18,816 INFO L226 Difference]: Without dead ends: 400 [2024-11-12 13:21:18,816 INFO L434 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-12 13:21:18,818 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 127 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:18,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 645 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-12 13:21:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 304. [2024-11-12 13:21:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.8017241379310345) internal successors, (418), 291 states have internal predecessors, (418), 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-12 13:21:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 438 transitions. [2024-11-12 13:21:18,834 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 438 transitions. Word has length 10 [2024-11-12 13:21:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:18,835 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 438 transitions. [2024-11-12 13:21:18,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 13:21:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 438 transitions. [2024-11-12 13:21:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:21:18,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:18,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:18,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:21:18,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:18,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash -249850320, now seen corresponding path program 1 times [2024-11-12 13:21:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:18,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175443659] [2024-11-12 13:21:18,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:18,942 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-12 13:21:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175443659] [2024-11-12 13:21:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175443659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:18,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:18,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923427961] [2024-11-12 13:21:18,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:18,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:18,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:18,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:18,947 INFO L87 Difference]: Start difference. First operand 304 states and 438 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 13:21:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,107 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2024-11-12 13:21:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:19,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-12 13:21:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,110 INFO L225 Difference]: With dead ends: 390 [2024-11-12 13:21:19,110 INFO L226 Difference]: Without dead ends: 390 [2024-11-12 13:21:19,111 INFO L434 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-12 13:21:19,112 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 112 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 669 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-12 13:21:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 303. [2024-11-12 13:21:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 231 states have (on average 1.8051948051948052) internal successors, (417), 290 states have internal predecessors, (417), 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-12 13:21:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 437 transitions. [2024-11-12 13:21:19,125 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 437 transitions. Word has length 10 [2024-11-12 13:21:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,125 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 437 transitions. [2024-11-12 13:21:19,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-12 13:21:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 437 transitions. [2024-11-12 13:21:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:21:19,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:21:19,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 787315061, now seen corresponding path program 1 times [2024-11-12 13:21:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277719320] [2024-11-12 13:21:19,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,150 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-12 13:21:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277719320] [2024-11-12 13:21:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277719320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349769700] [2024-11-12 13:21:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:19,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:19,154 INFO L87 Difference]: Start difference. First operand 303 states and 437 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-12 13:21:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,256 INFO L93 Difference]: Finished difference Result 358 states and 488 transitions. [2024-11-12 13:21:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:19,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-12 13:21:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,258 INFO L225 Difference]: With dead ends: 358 [2024-11-12 13:21:19,259 INFO L226 Difference]: Without dead ends: 351 [2024-11-12 13:21:19,259 INFO L434 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-12 13:21:19,259 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 68 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 223 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-12 13:21:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 300. [2024-11-12 13:21:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 228 states have (on average 1.8070175438596492) internal successors, (412), 287 states have internal predecessors, (412), 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-12 13:21:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 432 transitions. [2024-11-12 13:21:19,269 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 432 transitions. Word has length 11 [2024-11-12 13:21:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,269 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 432 transitions. [2024-11-12 13:21:19,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-12 13:21:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 432 transitions. [2024-11-12 13:21:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:21:19,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:21:19,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:19,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1918130468, now seen corresponding path program 1 times [2024-11-12 13:21:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054326389] [2024-11-12 13:21:19,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,322 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-12 13:21:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054326389] [2024-11-12 13:21:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054326389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957142138] [2024-11-12 13:21:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:19,325 INFO L87 Difference]: Start difference. First operand 300 states and 432 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-12 13:21:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,506 INFO L93 Difference]: Finished difference Result 396 states and 528 transitions. [2024-11-12 13:21:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-12 13:21:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,508 INFO L225 Difference]: With dead ends: 396 [2024-11-12 13:21:19,508 INFO L226 Difference]: Without dead ends: 396 [2024-11-12 13:21:19,508 INFO L434 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-12 13:21:19,509 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 163 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 279 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-12 13:21:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 300. [2024-11-12 13:21:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 228 states have (on average 1.780701754385965) internal successors, (406), 287 states have internal predecessors, (406), 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-12 13:21:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2024-11-12 13:21:19,518 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 13 [2024-11-12 13:21:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,518 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2024-11-12 13:21:19,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-12 13:21:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2024-11-12 13:21:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:21:19,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:21:19,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1918130467, now seen corresponding path program 1 times [2024-11-12 13:21:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307688638] [2024-11-12 13:21:19,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,641 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-12 13:21:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307688638] [2024-11-12 13:21:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307688638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107739788] [2024-11-12 13:21:19,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:19,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:19,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:19,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:19,644 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 13:21:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,846 INFO L93 Difference]: Finished difference Result 369 states and 472 transitions. [2024-11-12 13:21:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:19,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-12 13:21:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,849 INFO L225 Difference]: With dead ends: 369 [2024-11-12 13:21:19,849 INFO L226 Difference]: Without dead ends: 369 [2024-11-12 13:21:19,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12 13:21:19,850 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 108 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 579 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-12 13:21:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 310. [2024-11-12 13:21:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 235 states have (on average 1.7617021276595746) internal successors, (414), 295 states have internal predecessors, (414), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-12 13:21:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 440 transitions. [2024-11-12 13:21:19,876 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 440 transitions. Word has length 13 [2024-11-12 13:21:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,876 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 440 transitions. [2024-11-12 13:21:19,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 13:21:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 440 transitions. [2024-11-12 13:21:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:21:19,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:21:19,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:19,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1917206946, now seen corresponding path program 1 times [2024-11-12 13:21:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864684953] [2024-11-12 13:21:19,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,011 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-12 13:21:20,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864684953] [2024-11-12 13:21:20,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864684953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319023585] [2024-11-12 13:21:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:20,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:20,014 INFO L87 Difference]: Start difference. First operand 310 states and 440 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 13:21:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:20,229 INFO L93 Difference]: Finished difference Result 368 states and 470 transitions. [2024-11-12 13:21:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:20,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-12 13:21:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:20,232 INFO L225 Difference]: With dead ends: 368 [2024-11-12 13:21:20,232 INFO L226 Difference]: Without dead ends: 368 [2024-11-12 13:21:20,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12 13:21:20,233 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 103 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:20,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 637 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-12 13:21:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 304. [2024-11-12 13:21:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.771551724137931) internal successors, (411), 289 states have internal predecessors, (411), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 431 transitions. [2024-11-12 13:21:20,243 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 431 transitions. Word has length 13 [2024-11-12 13:21:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:20,243 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 431 transitions. [2024-11-12 13:21:20,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-12 13:21:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 431 transitions. [2024-11-12 13:21:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:21:20,246 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:20,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:20,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:21:20,246 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:20,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:20,247 INFO L85 PathProgramCache]: Analyzing trace with hash 398929757, now seen corresponding path program 1 times [2024-11-12 13:21:20,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:20,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222078202] [2024-11-12 13:21:20,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222078202] [2024-11-12 13:21:20,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222078202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118681840] [2024-11-12 13:21:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:20,294 INFO L87 Difference]: Start difference. First operand 304 states and 431 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-12 13:21:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:20,469 INFO L93 Difference]: Finished difference Result 396 states and 526 transitions. [2024-11-12 13:21:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:20,470 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-12 13:21:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:20,472 INFO L225 Difference]: With dead ends: 396 [2024-11-12 13:21:20,472 INFO L226 Difference]: Without dead ends: 396 [2024-11-12 13:21:20,472 INFO L434 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-12 13:21:20,473 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 134 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:20,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 286 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-12 13:21:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 310. [2024-11-12 13:21:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 238 states have (on average 1.7521008403361344) internal successors, (417), 295 states have internal predecessors, (417), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2024-11-12 13:21:20,481 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 15 [2024-11-12 13:21:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:20,481 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2024-11-12 13:21:20,481 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-12 13:21:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2024-11-12 13:21:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:21:20,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:20,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:21:20,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 398929758, now seen corresponding path program 1 times [2024-11-12 13:21:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962658358] [2024-11-12 13:21:20,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962658358] [2024-11-12 13:21:20,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962658358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466489965] [2024-11-12 13:21:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:20,556 INFO L87 Difference]: Start difference. First operand 310 states and 437 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-12 13:21:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:20,705 INFO L93 Difference]: Finished difference Result 359 states and 449 transitions. [2024-11-12 13:21:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:20,706 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-12 13:21:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:20,707 INFO L225 Difference]: With dead ends: 359 [2024-11-12 13:21:20,708 INFO L226 Difference]: Without dead ends: 359 [2024-11-12 13:21:20,708 INFO L434 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-12 13:21:20,708 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 105 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:20,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 361 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-12 13:21:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 310. [2024-11-12 13:21:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 238 states have (on average 1.7142857142857142) internal successors, (408), 295 states have internal predecessors, (408), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 428 transitions. [2024-11-12 13:21:20,716 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 428 transitions. Word has length 15 [2024-11-12 13:21:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:20,717 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 428 transitions. [2024-11-12 13:21:20,717 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-12 13:21:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 428 transitions. [2024-11-12 13:21:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:21:20,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:20,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:21:20,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 688488293, now seen corresponding path program 1 times [2024-11-12 13:21:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177628247] [2024-11-12 13:21:20,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,773 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-12 13:21:20,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177628247] [2024-11-12 13:21:20,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177628247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386065380] [2024-11-12 13:21:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:20,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:20,776 INFO L87 Difference]: Start difference. First operand 310 states and 428 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-12 13:21:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:20,850 INFO L93 Difference]: Finished difference Result 307 states and 422 transitions. [2024-11-12 13:21:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:20,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-12 13:21:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:20,852 INFO L225 Difference]: With dead ends: 307 [2024-11-12 13:21:20,852 INFO L226 Difference]: Without dead ends: 307 [2024-11-12 13:21:20,852 INFO L434 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-12 13:21:20,853 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:20,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 230 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-12 13:21:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-12 13:21:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 238 states have (on average 1.6890756302521008) internal successors, (402), 292 states have internal predecessors, (402), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 422 transitions. [2024-11-12 13:21:20,862 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 422 transitions. Word has length 19 [2024-11-12 13:21:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:20,863 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 422 transitions. [2024-11-12 13:21:20,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-12 13:21:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 422 transitions. [2024-11-12 13:21:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:21:20,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:20,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:20,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:21:20,865 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:20,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash 688488294, now seen corresponding path program 1 times [2024-11-12 13:21:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447385405] [2024-11-12 13:21:20,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,944 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-12 13:21:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447385405] [2024-11-12 13:21:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447385405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752414150] [2024-11-12 13:21:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:20,947 INFO L87 Difference]: Start difference. First operand 307 states and 422 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-12 13:21:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,034 INFO L93 Difference]: Finished difference Result 310 states and 424 transitions. [2024-11-12 13:21:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-12 13:21:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,036 INFO L225 Difference]: With dead ends: 310 [2024-11-12 13:21:21,036 INFO L226 Difference]: Without dead ends: 310 [2024-11-12 13:21:21,036 INFO L434 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-12 13:21:21,036 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 341 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-12 13:21:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-12 13:21:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 242 states have (on average 1.6694214876033058) internal successors, (404), 295 states have internal predecessors, (404), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 424 transitions. [2024-11-12 13:21:21,043 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 424 transitions. Word has length 19 [2024-11-12 13:21:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,044 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 424 transitions. [2024-11-12 13:21:21,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-12 13:21:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 424 transitions. [2024-11-12 13:21:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:21:21,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:21,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:21:21,045 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash -131699369, now seen corresponding path program 1 times [2024-11-12 13:21:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334604066] [2024-11-12 13:21:21,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,125 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-12 13:21:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334604066] [2024-11-12 13:21:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334604066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671453699] [2024-11-12 13:21:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:21,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:21,128 INFO L87 Difference]: Start difference. First operand 310 states and 424 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-12 13:21:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,154 INFO L93 Difference]: Finished difference Result 316 states and 430 transitions. [2024-11-12 13:21:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2024-11-12 13:21:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,156 INFO L225 Difference]: With dead ends: 316 [2024-11-12 13:21:21,156 INFO L226 Difference]: Without dead ends: 316 [2024-11-12 13:21:21,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12 13:21:21,156 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 11 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-12 13:21:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2024-11-12 13:21:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 244 states have (on average 1.6639344262295082) internal successors, (406), 297 states have internal predecessors, (406), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 426 transitions. [2024-11-12 13:21:21,167 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 426 transitions. Word has length 20 [2024-11-12 13:21:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,167 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 426 transitions. [2024-11-12 13:21:21,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-12 13:21:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 426 transitions. [2024-11-12 13:21:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:21:21,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:21,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:21:21,171 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:21,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash -131643665, now seen corresponding path program 1 times [2024-11-12 13:21:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251229629] [2024-11-12 13:21:21,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,255 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-12 13:21:21,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:21,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251229629] [2024-11-12 13:21:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251229629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568136795] [2024-11-12 13:21:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:21,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:21,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:21,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:21,258 INFO L87 Difference]: Start difference. First operand 312 states and 426 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-12 13:21:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,320 INFO L93 Difference]: Finished difference Result 362 states and 490 transitions. [2024-11-12 13:21:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:21,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 20 [2024-11-12 13:21:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,323 INFO L225 Difference]: With dead ends: 362 [2024-11-12 13:21:21,323 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 13:21:21,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:21,324 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 31 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 850 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 13:21:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 338. [2024-11-12 13:21:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 265 states have (on average 1.6264150943396227) internal successors, (431), 319 states have internal predecessors, (431), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 461 transitions. [2024-11-12 13:21:21,335 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 461 transitions. Word has length 20 [2024-11-12 13:21:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,336 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 461 transitions. [2024-11-12 13:21:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-12 13:21:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2024-11-12 13:21:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:21:21,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:21,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:21:21,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2560946, now seen corresponding path program 1 times [2024-11-12 13:21:21,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705346013] [2024-11-12 13:21:21,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,424 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-12 13:21:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705346013] [2024-11-12 13:21:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705346013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:21,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:21,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:21,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311322073] [2024-11-12 13:21:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:21,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:21,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:21,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:21,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:21,427 INFO L87 Difference]: Start difference. First operand 338 states and 461 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12 13:21:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,526 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-11-12 13:21:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:21,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 20 [2024-11-12 13:21:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,528 INFO L225 Difference]: With dead ends: 342 [2024-11-12 13:21:21,529 INFO L226 Difference]: Without dead ends: 342 [2024-11-12 13:21:21,529 INFO L434 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-12 13:21:21,529 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 6 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-12 13:21:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-12 13:21:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 269 states have (on average 1.6171003717472119) internal successors, (435), 323 states have internal predecessors, (435), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 465 transitions. [2024-11-12 13:21:21,537 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 465 transitions. Word has length 20 [2024-11-12 13:21:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,538 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 465 transitions. [2024-11-12 13:21:21,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12 13:21:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 465 transitions. [2024-11-12 13:21:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:21:21,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:21,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:21:21,539 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:21,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2559024, now seen corresponding path program 1 times [2024-11-12 13:21:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708967628] [2024-11-12 13:21:21,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,611 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-12 13:21:21,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708967628] [2024-11-12 13:21:21,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708967628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:21,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:21,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174960644] [2024-11-12 13:21:21,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:21,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:21,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:21,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:21,614 INFO L87 Difference]: Start difference. First operand 342 states and 465 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-12 13:21:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,671 INFO L93 Difference]: Finished difference Result 375 states and 504 transitions. [2024-11-12 13:21:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:21,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 20 [2024-11-12 13:21:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,673 INFO L225 Difference]: With dead ends: 375 [2024-11-12 13:21:21,673 INFO L226 Difference]: Without dead ends: 375 [2024-11-12 13:21:21,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:21,674 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 45 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 952 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-12 13:21:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 337. [2024-11-12 13:21:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 265 states have (on average 1.6113207547169812) internal successors, (427), 318 states have internal predecessors, (427), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 457 transitions. [2024-11-12 13:21:21,683 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 457 transitions. Word has length 20 [2024-11-12 13:21:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,683 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 457 transitions. [2024-11-12 13:21:21,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-12 13:21:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 457 transitions. [2024-11-12 13:21:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:21:21,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,686 INFO L218 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-12 13:21:21,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:21:21,686 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash 59872289, now seen corresponding path program 1 times [2024-11-12 13:21:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4213760] [2024-11-12 13:21:21,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,928 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-12 13:21:21,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4213760] [2024-11-12 13:21:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4213760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:21,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:21,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:21,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212908245] [2024-11-12 13:21:21,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:21,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:21,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:21,931 INFO L87 Difference]: Start difference. First operand 337 states and 457 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-12 13:21:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:22,253 INFO L93 Difference]: Finished difference Result 416 states and 525 transitions. [2024-11-12 13:21:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:22,253 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-12 13:21:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:22,255 INFO L225 Difference]: With dead ends: 416 [2024-11-12 13:21:22,255 INFO L226 Difference]: Without dead ends: 416 [2024-11-12 13:21:22,255 INFO L434 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-12 13:21:22,256 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 101 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:22,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 899 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-12 13:21:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 331. [2024-11-12 13:21:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 259 states have (on average 1.606177606177606) internal successors, (416), 312 states have internal predecessors, (416), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 446 transitions. [2024-11-12 13:21:22,264 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 446 transitions. Word has length 21 [2024-11-12 13:21:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:22,264 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 446 transitions. [2024-11-12 13:21:22,264 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-12 13:21:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 446 transitions. [2024-11-12 13:21:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:21:22,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:22,265 INFO L218 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-12 13:21:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:21:22,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -79389329, now seen corresponding path program 1 times [2024-11-12 13:21:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653095124] [2024-11-12 13:21:22,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,333 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-12 13:21:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653095124] [2024-11-12 13:21:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653095124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:22,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75286050] [2024-11-12 13:21:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:22,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:22,336 INFO L87 Difference]: Start difference. First operand 331 states and 446 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-12 13:21:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:22,426 INFO L93 Difference]: Finished difference Result 334 states and 448 transitions. [2024-11-12 13:21:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-12 13:21:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:22,428 INFO L225 Difference]: With dead ends: 334 [2024-11-12 13:21:22,428 INFO L226 Difference]: Without dead ends: 334 [2024-11-12 13:21:22,429 INFO L434 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-12 13:21:22,429 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:22,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 340 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-12 13:21:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2024-11-12 13:21:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 253 states have (on average 1.6126482213438735) internal successors, (408), 305 states have internal predecessors, (408), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 438 transitions. [2024-11-12 13:21:22,437 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 438 transitions. Word has length 21 [2024-11-12 13:21:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:22,437 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 438 transitions. [2024-11-12 13:21:22,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-12 13:21:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 438 transitions. [2024-11-12 13:21:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:21:22,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:22,438 INFO L218 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-12 13:21:22,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:21:22,439 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:22,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1710334668, now seen corresponding path program 1 times [2024-11-12 13:21:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:22,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81239016] [2024-11-12 13:21:22,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,488 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-12 13:21:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81239016] [2024-11-12 13:21:22,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81239016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:22,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:22,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446579196] [2024-11-12 13:21:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:22,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:22,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:22,490 INFO L87 Difference]: Start difference. First operand 324 states and 438 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-12 13:21:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:22,583 INFO L93 Difference]: Finished difference Result 329 states and 437 transitions. [2024-11-12 13:21:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-12 13:21:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:22,585 INFO L225 Difference]: With dead ends: 329 [2024-11-12 13:21:22,585 INFO L226 Difference]: Without dead ends: 329 [2024-11-12 13:21:22,585 INFO L434 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-12 13:21:22,586 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 34 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:22,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 305 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-12 13:21:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2024-11-12 13:21:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.5465116279069768) internal successors, (399), 304 states have internal predecessors, (399), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 429 transitions. [2024-11-12 13:21:22,593 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 429 transitions. Word has length 23 [2024-11-12 13:21:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:22,594 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 429 transitions. [2024-11-12 13:21:22,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-12 13:21:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 429 transitions. [2024-11-12 13:21:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:21:22,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:22,594 INFO L218 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-12 13:21:22,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:21:22,595 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1710334669, now seen corresponding path program 1 times [2024-11-12 13:21:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:22,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609128636] [2024-11-12 13:21:22,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,746 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-12 13:21:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:22,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609128636] [2024-11-12 13:21:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609128636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:22,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:22,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961870068] [2024-11-12 13:21:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:22,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:22,748 INFO L87 Difference]: Start difference. First operand 323 states and 429 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-12 13:21:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:22,927 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2024-11-12 13:21:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:22,928 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-12 13:21:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:22,930 INFO L225 Difference]: With dead ends: 247 [2024-11-12 13:21:22,931 INFO L226 Difference]: Without dead ends: 247 [2024-11-12 13:21:22,931 INFO L434 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-12 13:21:22,931 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 46 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:22,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 884 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-12 13:21:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 225. [2024-11-12 13:21:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 168 states have (on average 1.5238095238095237) internal successors, (256), 212 states have internal predecessors, (256), 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-12 13:21:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 274 transitions. [2024-11-12 13:21:22,939 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 274 transitions. Word has length 23 [2024-11-12 13:21:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:22,940 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 274 transitions. [2024-11-12 13:21:22,940 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-12 13:21:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 274 transitions. [2024-11-12 13:21:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:21:22,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:22,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:22,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:21:22,942 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2045900250, now seen corresponding path program 1 times [2024-11-12 13:21:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574842020] [2024-11-12 13:21:22,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,198 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-12 13:21:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574842020] [2024-11-12 13:21:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574842020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100355715] [2024-11-12 13:21:23,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:23,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:23,201 INFO L87 Difference]: Start difference. First operand 225 states and 274 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-12 13:21:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,390 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2024-11-12 13:21:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:21:23,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 24 [2024-11-12 13:21:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,392 INFO L225 Difference]: With dead ends: 256 [2024-11-12 13:21:23,392 INFO L226 Difference]: Without dead ends: 256 [2024-11-12 13:21:23,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:23,392 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 858 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-12 13:21:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 235. [2024-11-12 13:21:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.4943820224719102) internal successors, (266), 222 states have internal predecessors, (266), 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-12 13:21:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2024-11-12 13:21:23,399 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 24 [2024-11-12 13:21:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,399 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2024-11-12 13:21:23,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-12 13:21:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2024-11-12 13:21:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:21:23,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:23,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:21:23,400 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1535366073, now seen corresponding path program 1 times [2024-11-12 13:21:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623684980] [2024-11-12 13:21:23,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,490 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-12 13:21:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623684980] [2024-11-12 13:21:23,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623684980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120353390] [2024-11-12 13:21:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:23,492 INFO L87 Difference]: Start difference. First operand 235 states and 284 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-12 13:21:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,561 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2024-11-12 13:21:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 24 [2024-11-12 13:21:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,563 INFO L225 Difference]: With dead ends: 259 [2024-11-12 13:21:23,563 INFO L226 Difference]: Without dead ends: 259 [2024-11-12 13:21:23,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:23,564 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 20 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 892 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-12 13:21:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2024-11-12 13:21:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.4831460674157304) internal successors, (264), 222 states have internal predecessors, (264), 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-12 13:21:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2024-11-12 13:21:23,570 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 24 [2024-11-12 13:21:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,570 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2024-11-12 13:21:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-12 13:21:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2024-11-12 13:21:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:21:23,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:23,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:21:23,571 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:23,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1674205682, now seen corresponding path program 1 times [2024-11-12 13:21:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249793701] [2024-11-12 13:21:23,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,765 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-12 13:21:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249793701] [2024-11-12 13:21:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249793701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318331551] [2024-11-12 13:21:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:23,767 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-12 13:21:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,952 INFO L93 Difference]: Finished difference Result 253 states and 301 transitions. [2024-11-12 13:21:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:21:23,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 25 [2024-11-12 13:21:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,954 INFO L225 Difference]: With dead ends: 253 [2024-11-12 13:21:23,954 INFO L226 Difference]: Without dead ends: 253 [2024-11-12 13:21:23,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:23,955 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 53 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 923 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-12 13:21:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2024-11-12 13:21:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 183 states have (on average 1.469945355191257) internal successors, (269), 227 states have internal predecessors, (269), 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-12 13:21:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 287 transitions. [2024-11-12 13:21:23,961 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 287 transitions. Word has length 25 [2024-11-12 13:21:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,962 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 287 transitions. [2024-11-12 13:21:23,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-12 13:21:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 287 transitions. [2024-11-12 13:21:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:21:23,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,962 INFO L218 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-12 13:21:23,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 13:21:23,963 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash -984725155, now seen corresponding path program 1 times [2024-11-12 13:21:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069425057] [2024-11-12 13:21:23,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,179 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-12 13:21:24,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069425057] [2024-11-12 13:21:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069425057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:24,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830158167] [2024-11-12 13:21:24,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:24,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:24,183 INFO L87 Difference]: Start difference. First operand 240 states and 287 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-12 13:21:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,509 INFO L93 Difference]: Finished difference Result 431 states and 519 transitions. [2024-11-12 13:21:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:24,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-12 13:21:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,511 INFO L225 Difference]: With dead ends: 431 [2024-11-12 13:21:24,511 INFO L226 Difference]: Without dead ends: 431 [2024-11-12 13:21:24,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:24,512 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 151 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 609 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-12 13:21:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 367. [2024-11-12 13:21:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 302 states have (on average 1.5033112582781456) internal successors, (454), 348 states have internal predecessors, (454), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 484 transitions. [2024-11-12 13:21:24,520 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 484 transitions. Word has length 26 [2024-11-12 13:21:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,521 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 484 transitions. [2024-11-12 13:21:24,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-12 13:21:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 484 transitions. [2024-11-12 13:21:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:21:24,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,522 INFO L218 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-12 13:21:24,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 13:21:24,522 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:24,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash -461708714, now seen corresponding path program 1 times [2024-11-12 13:21:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105543247] [2024-11-12 13:21:24,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,696 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-12 13:21:24,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105543247] [2024-11-12 13:21:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105543247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:24,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426624582] [2024-11-12 13:21:24,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:24,699 INFO L87 Difference]: Start difference. First operand 367 states and 484 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-12 13:21:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,838 INFO L93 Difference]: Finished difference Result 396 states and 514 transitions. [2024-11-12 13:21:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-12 13:21:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,840 INFO L225 Difference]: With dead ends: 396 [2024-11-12 13:21:24,840 INFO L226 Difference]: Without dead ends: 396 [2024-11-12 13:21:24,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:24,841 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 569 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-12 13:21:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 388. [2024-11-12 13:21:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 324 states have (on average 1.4814814814814814) internal successors, (480), 369 states have internal predecessors, (480), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 510 transitions. [2024-11-12 13:21:24,849 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 510 transitions. Word has length 27 [2024-11-12 13:21:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,849 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 510 transitions. [2024-11-12 13:21:24,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-12 13:21:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 510 transitions. [2024-11-12 13:21:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:21:24,849 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,850 INFO L218 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-12 13:21:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 13:21:24,850 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:24,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1700919435, now seen corresponding path program 1 times [2024-11-12 13:21:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066267380] [2024-11-12 13:21:24,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,137 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-12 13:21:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066267380] [2024-11-12 13:21:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066267380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:21:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999359538] [2024-11-12 13:21:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:21:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:21:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:21:25,140 INFO L87 Difference]: Start difference. First operand 388 states and 510 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-12 13:21:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,619 INFO L93 Difference]: Finished difference Result 574 states and 736 transitions. [2024-11-12 13:21:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-12 13:21:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,622 INFO L225 Difference]: With dead ends: 574 [2024-11-12 13:21:25,622 INFO L226 Difference]: Without dead ends: 574 [2024-11-12 13:21:25,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:25,623 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 169 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:25,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1209 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-12 13:21:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 511. [2024-11-12 13:21:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 439 states have (on average 1.501138952164009) internal successors, (659), 486 states have internal predecessors, (659), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2024-11-12 13:21:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 701 transitions. [2024-11-12 13:21:25,637 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 701 transitions. Word has length 27 [2024-11-12 13:21:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,638 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 701 transitions. [2024-11-12 13:21:25,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-12 13:21:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 701 transitions. [2024-11-12 13:21:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:21:25,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,638 INFO L218 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-12 13:21:25,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 13:21:25,639 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1188894914, now seen corresponding path program 1 times [2024-11-12 13:21:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502893611] [2024-11-12 13:21:25,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,754 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-12 13:21:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502893611] [2024-11-12 13:21:25,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502893611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350063369] [2024-11-12 13:21:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:25,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:25,757 INFO L87 Difference]: Start difference. First operand 511 states and 701 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,936 INFO L93 Difference]: Finished difference Result 528 states and 714 transitions. [2024-11-12 13:21:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-12 13:21:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,939 INFO L225 Difference]: With dead ends: 528 [2024-11-12 13:21:25,939 INFO L226 Difference]: Without dead ends: 528 [2024-11-12 13:21:25,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:25,943 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 149 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:25,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 694 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-12 13:21:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 520. [2024-11-12 13:21:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 449 states have (on average 1.487750556792873) internal successors, (668), 495 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2024-11-12 13:21:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 710 transitions. [2024-11-12 13:21:25,956 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 710 transitions. Word has length 28 [2024-11-12 13:21:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,956 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 710 transitions. [2024-11-12 13:21:25,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 710 transitions. [2024-11-12 13:21:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:21:25,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,958 INFO L218 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-12 13:21:25,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 13:21:25,959 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:25,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1320441736, now seen corresponding path program 1 times [2024-11-12 13:21:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538018730] [2024-11-12 13:21:25,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,137 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-12 13:21:26,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538018730] [2024-11-12 13:21:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538018730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:26,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:26,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266665612] [2024-11-12 13:21:26,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:26,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:26,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:26,139 INFO L87 Difference]: Start difference. First operand 520 states and 710 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-12 13:21:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,301 INFO L93 Difference]: Finished difference Result 519 states and 690 transitions. [2024-11-12 13:21:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:26,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-12 13:21:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,303 INFO L225 Difference]: With dead ends: 519 [2024-11-12 13:21:26,303 INFO L226 Difference]: Without dead ends: 519 [2024-11-12 13:21:26,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:26,304 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 192 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 242 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-12 13:21:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 481. [2024-11-12 13:21:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 417 states have (on average 1.434052757793765) internal successors, (598), 456 states have internal predecessors, (598), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2024-11-12 13:21:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 640 transitions. [2024-11-12 13:21:26,316 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 640 transitions. Word has length 29 [2024-11-12 13:21:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,317 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 640 transitions. [2024-11-12 13:21:26,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-12 13:21:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 640 transitions. [2024-11-12 13:21:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:21:26,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,318 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 13:21:26,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 13:21:26,318 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:26,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1684807341, now seen corresponding path program 1 times [2024-11-12 13:21:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424543623] [2024-11-12 13:21:26,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 13:21:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:21:26,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424543623] [2024-11-12 13:21:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424543623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488242718] [2024-11-12 13:21:26,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:26,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:26,559 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-12 13:21:26,560 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-12 13:21:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:21:26,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:27,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:27,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:27,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-12 13:21:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:21:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488242718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:21:27,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:21:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2024-11-12 13:21:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254643932] [2024-11-12 13:21:27,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:21:27,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 13:21:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 13:21:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:21:27,393 INFO L87 Difference]: Start difference. First operand 481 states and 640 transitions. Second operand has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 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-12 13:21:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:27,701 INFO L93 Difference]: Finished difference Result 508 states and 664 transitions. [2024-11-12 13:21:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:21:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 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 40 [2024-11-12 13:21:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:27,703 INFO L225 Difference]: With dead ends: 508 [2024-11-12 13:21:27,704 INFO L226 Difference]: Without dead ends: 508 [2024-11-12 13:21:27,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:21:27,705 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 672 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:27,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 568 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-12 13:21:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 379. [2024-11-12 13:21:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 324 states have (on average 1.3919753086419753) internal successors, (451), 360 states have internal predecessors, (451), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 481 transitions. [2024-11-12 13:21:27,713 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 481 transitions. Word has length 40 [2024-11-12 13:21:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:27,713 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 481 transitions. [2024-11-12 13:21:27,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 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-12 13:21:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 481 transitions. [2024-11-12 13:21:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:21:27,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:27,714 INFO L218 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] [2024-11-12 13:21:27,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:27,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:27,919 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:27,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:27,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1517564365, now seen corresponding path program 1 times [2024-11-12 13:21:27,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128148453] [2024-11-12 13:21:27,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,196 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-12 13:21:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128148453] [2024-11-12 13:21:28,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128148453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792669632] [2024-11-12 13:21:28,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:28,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:28,200 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-12 13:21:28,201 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-12 13:21:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:21:28,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:28,600 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-12 13:21:28,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792669632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:28,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2024-11-12 13:21:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587916801] [2024-11-12 13:21:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:28,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:28,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:28,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:21:28,603 INFO L87 Difference]: Start difference. First operand 379 states and 481 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-12 13:21:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:28,731 INFO L93 Difference]: Finished difference Result 386 states and 488 transitions. [2024-11-12 13:21:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 40 [2024-11-12 13:21:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:28,733 INFO L225 Difference]: With dead ends: 386 [2024-11-12 13:21:28,733 INFO L226 Difference]: Without dead ends: 386 [2024-11-12 13:21:28,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:21:28,734 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 157 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:28,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 242 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-12 13:21:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2024-11-12 13:21:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 326 states have (on average 1.392638036809816) internal successors, (454), 362 states have internal predecessors, (454), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 484 transitions. [2024-11-12 13:21:28,743 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 484 transitions. Word has length 40 [2024-11-12 13:21:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:28,743 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 484 transitions. [2024-11-12 13:21:28,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-12 13:21:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 484 transitions. [2024-11-12 13:21:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:21:28,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:28,744 INFO L218 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] [2024-11-12 13:21:28,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:21:28,948 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,SelfDestructingSolverStorable31 [2024-11-12 13:21:28,949 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:28,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1517564303, now seen corresponding path program 1 times [2024-11-12 13:21:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:28,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250892234] [2024-11-12 13:21:28,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,116 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-12 13:21:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250892234] [2024-11-12 13:21:29,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250892234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:29,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376328942] [2024-11-12 13:21:29,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:29,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:29,119 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-12 13:21:29,120 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-12 13:21:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:21:29,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:29,488 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-12 13:21:29,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376328942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2024-11-12 13:21:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909650531] [2024-11-12 13:21:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:29,490 INFO L87 Difference]: Start difference. First operand 381 states and 484 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-12 13:21:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,632 INFO L93 Difference]: Finished difference Result 385 states and 486 transitions. [2024-11-12 13:21:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 40 [2024-11-12 13:21:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,634 INFO L225 Difference]: With dead ends: 385 [2024-11-12 13:21:29,634 INFO L226 Difference]: Without dead ends: 385 [2024-11-12 13:21:29,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:29,635 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 227 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 311 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-12 13:21:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 378. [2024-11-12 13:21:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 324 states have (on average 1.3858024691358024) internal successors, (449), 359 states have internal predecessors, (449), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 479 transitions. [2024-11-12 13:21:29,646 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 479 transitions. Word has length 40 [2024-11-12 13:21:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 479 transitions. [2024-11-12 13:21:29,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-12 13:21:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 479 transitions. [2024-11-12 13:21:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:21:29,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,647 INFO L218 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] [2024-11-12 13:21:29,664 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-12 13:21:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:29,849 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1078522670, now seen corresponding path program 1 times [2024-11-12 13:21:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369274647] [2024-11-12 13:21:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 13:21:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,034 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-12 13:21:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369274647] [2024-11-12 13:21:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369274647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:30,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:30,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590511059] [2024-11-12 13:21:30,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:30,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:30,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:30,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:30,035 INFO L87 Difference]: Start difference. First operand 378 states and 479 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-12 13:21:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,175 INFO L93 Difference]: Finished difference Result 380 states and 475 transitions. [2024-11-12 13:21:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:30,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 42 [2024-11-12 13:21:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,177 INFO L225 Difference]: With dead ends: 380 [2024-11-12 13:21:30,177 INFO L226 Difference]: Without dead ends: 380 [2024-11-12 13:21:30,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:30,178 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 141 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 248 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-12 13:21:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2024-11-12 13:21:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 324 states have (on average 1.3611111111111112) internal successors, (441), 357 states have internal predecessors, (441), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 471 transitions. [2024-11-12 13:21:30,187 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 471 transitions. Word has length 42 [2024-11-12 13:21:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,187 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 471 transitions. [2024-11-12 13:21:30,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-12 13:21:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 471 transitions. [2024-11-12 13:21:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 13:21:30,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,188 INFO L218 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] [2024-11-12 13:21:30,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 13:21:30,188 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash -934084823, now seen corresponding path program 1 times [2024-11-12 13:21:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095951975] [2024-11-12 13:21:30,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:31,131 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-12 13:21:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095951975] [2024-11-12 13:21:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095951975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:31,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:31,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 13:21:31,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359518201] [2024-11-12 13:21:31,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:31,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:21:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:31,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:21:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:31,134 INFO L87 Difference]: Start difference. First operand 376 states and 471 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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-12 13:21:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:31,681 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2024-11-12 13:21:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:31,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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 43 [2024-11-12 13:21:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:31,683 INFO L225 Difference]: With dead ends: 394 [2024-11-12 13:21:31,683 INFO L226 Difference]: Without dead ends: 394 [2024-11-12 13:21:31,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:21:31,684 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 77 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:31,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 903 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-12 13:21:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 390. [2024-11-12 13:21:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 338 states have (on average 1.3520710059171597) internal successors, (457), 371 states have internal predecessors, (457), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 487 transitions. [2024-11-12 13:21:31,693 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 487 transitions. Word has length 43 [2024-11-12 13:21:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:31,693 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 487 transitions. [2024-11-12 13:21:31,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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-12 13:21:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 487 transitions. [2024-11-12 13:21:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:21:31,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:31,694 INFO L218 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] [2024-11-12 13:21:31,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-12 13:21:31,694 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:31,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1138243033, now seen corresponding path program 1 times [2024-11-12 13:21:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:31,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448990319] [2024-11-12 13:21:31,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,480 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-12 13:21:32,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:32,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448990319] [2024-11-12 13:21:32,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448990319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:32,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:32,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 13:21:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45655513] [2024-11-12 13:21:32,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:32,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:21:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:21:32,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:21:32,484 INFO L87 Difference]: Start difference. First operand 390 states and 487 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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-12 13:21:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:32,728 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2024-11-12 13:21:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:21:32,728 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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 44 [2024-11-12 13:21:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:32,730 INFO L225 Difference]: With dead ends: 394 [2024-11-12 13:21:32,730 INFO L226 Difference]: Without dead ends: 394 [2024-11-12 13:21:32,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:32,731 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 66 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:32,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 717 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-12 13:21:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2024-11-12 13:21:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 339 states have (on average 1.351032448377581) internal successors, (458), 372 states have internal predecessors, (458), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 488 transitions. [2024-11-12 13:21:32,739 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 488 transitions. Word has length 44 [2024-11-12 13:21:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:32,739 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 488 transitions. [2024-11-12 13:21:32,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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-12 13:21:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 488 transitions. [2024-11-12 13:21:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:21:32,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:32,740 INFO L218 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] [2024-11-12 13:21:32,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 13:21:32,741 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-12 13:21:32,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1516678113, now seen corresponding path program 1 times [2024-11-12 13:21:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319446939] [2024-11-12 13:21:32,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:33,777 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-12 13:21:33,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319446939] [2024-11-12 13:21:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319446939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520659685] [2024-11-12 13:21:33,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:33,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:33,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:33,780 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-12 13:21:33,781 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-12 13:21:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:33,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-12 13:21:33,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:34,061 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-12 13:21:34,346 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-12 13:21:34,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2024-11-12 13:21:34,360 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-12 13:21:34,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2024-11-12 13:21:34,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:34,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:34,759 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-12 13:21:34,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 94 [2024-11-12 13:21:34,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:34,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:34,796 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-12 13:21:34,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 86 [2024-11-12 13:21:35,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:35,690 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 108 treesize of output 96 [2024-11-12 13:21:35,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:35,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 94 [2024-11-12 13:21:36,392 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-12 13:21:36,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:44,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:44,473 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 212 treesize of output 217