./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:41:13,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:41:13,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:41:13,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:41:13,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:41:13,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:41:13,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:41:13,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:41:13,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:41:13,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:41:13,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:41:13,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:41:13,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:41:13,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:41:13,373 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:41:13,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:41:13,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:41:13,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:41:13,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:41:13,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:41:13,376 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:41:13,376 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:41:13,376 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:41:13,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:41:13,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:41:13,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:41:13,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:41:13,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:41:13,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:41:13,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:41:13,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:41:13,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:41:13,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:41:13,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:13,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:41:13,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:41:13,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:41:13,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:41:13,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:41:13,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:41:13,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:41:13,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:41:13,386 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-19 06:41:13,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:41:13,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:41:13,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:41:13,681 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:41:13,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:41:13,683 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-19 06:41:15,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:41:15,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:41:15,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0214.i [2024-11-19 06:41:15,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee669de1/ffde2ac21fe7483bae7a5f7bd5fe86fc/FLAG3ca28978b [2024-11-19 06:41:15,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee669de1/ffde2ac21fe7483bae7a5f7bd5fe86fc [2024-11-19 06:41:15,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:41:15,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:41:15,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:15,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:41:15,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:41:15,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:15" (1/1) ... [2024-11-19 06:41:15,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639eecfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:15, skipping insertion in model container [2024-11-19 06:41:15,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:15" (1/1) ... [2024-11-19 06:41:15,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:41:16,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:16,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:41:16,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:16,332 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:41:16,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16 WrapperNode [2024-11-19 06:41:16,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:16,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:16,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:41:16,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:41:16,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,395 INFO L138 Inliner]: procedures = 181, calls = 42, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 176 [2024-11-19 06:41:16,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:16,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:41:16,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:41:16,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:41:16,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,436 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 7, 18]. 67 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 11 writes are split as follows [0, 5, 6]. [2024-11-19 06:41:16,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:41:16,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:41:16,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:41:16,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:41:16,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (1/1) ... [2024-11-19 06:41:16,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:16,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:16,502 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-19 06:41:16,506 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-19 06:41:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-11-19 06:41:16,556 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-11-19 06:41:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:41:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:41:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 06:41:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:41:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:41:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:41:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:41:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:41:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:41:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:41:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:41:16,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:41:16,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:41:16,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:41:17,121 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2024-11-19 06:41:17,121 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:41:17,141 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:41:17,141 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 06:41:17,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:17 BoogieIcfgContainer [2024-11-19 06:41:17,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:41:17,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:41:17,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:41:17,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:41:17,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:41:15" (1/3) ... [2024-11-19 06:41:17,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447902fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:17, skipping insertion in model container [2024-11-19 06:41:17,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:16" (2/3) ... [2024-11-19 06:41:17,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447902fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:17, skipping insertion in model container [2024-11-19 06:41:17,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:17" (3/3) ... [2024-11-19 06:41:17,149 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0214.i [2024-11-19 06:41:17,163 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:41:17,163 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-11-19 06:41:17,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:41:17,213 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;@2c21b2a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:41:17,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2024-11-19 06:41:17,218 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-19 06:41:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:41:17,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:17,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:41:17,225 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-19 06:41:17,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1072948778, now seen corresponding path program 1 times [2024-11-19 06:41:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241375666] [2024-11-19 06:41:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:17,398 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-19 06:41:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241375666] [2024-11-19 06:41:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241375666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644293577] [2024-11-19 06:41:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:17,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:41:17,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:41:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:17,442 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-19 06:41:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:17,467 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2024-11-19 06:41:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:41:17,470 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-19 06:41:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:17,478 INFO L225 Difference]: With dead ends: 142 [2024-11-19 06:41:17,479 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 06:41:17,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:17,484 INFO L432 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-19 06:41:17,485 INFO L433 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-19 06:41:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 06:41:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-19 06:41:17,517 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-19 06:41:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2024-11-19 06:41:17,521 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 6 [2024-11-19 06:41:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:17,521 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2024-11-19 06:41:17,522 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-19 06:41:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2024-11-19 06:41:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:17,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:17,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:17,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:41:17,523 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-19 06:41:17,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381875, now seen corresponding path program 1 times [2024-11-19 06:41:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:17,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581668700] [2024-11-19 06:41:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:17,674 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-19 06:41:17,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:17,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581668700] [2024-11-19 06:41:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581668700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:17,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:41:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989230051] [2024-11-19 06:41:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:17,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:17,679 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-19 06:41:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:17,923 INFO L93 Difference]: Finished difference Result 271 states and 300 transitions. [2024-11-19 06:41:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:17,923 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-19 06:41:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:17,926 INFO L225 Difference]: With dead ends: 271 [2024-11-19 06:41:17,926 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 06:41:17,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:17,929 INFO L432 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-19 06:41:17,930 INFO L433 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-19 06:41:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 06:41:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 189. [2024-11-19 06:41:17,947 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-19 06:41:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 242 transitions. [2024-11-19 06:41:17,950 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 242 transitions. Word has length 7 [2024-11-19 06:41:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:17,950 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 242 transitions. [2024-11-19 06:41:17,951 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-19 06:41:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 242 transitions. [2024-11-19 06:41:17,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:17,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:17,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:17,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:41:17,953 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-19 06:41:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381874, now seen corresponding path program 1 times [2024-11-19 06:41:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730522483] [2024-11-19 06:41:17,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:18,121 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-19 06:41:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730522483] [2024-11-19 06:41:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730522483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:18,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153248663] [2024-11-19 06:41:18,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:18,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:18,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:18,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:18,126 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-19 06:41:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:18,311 INFO L93 Difference]: Finished difference Result 319 states and 397 transitions. [2024-11-19 06:41:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:18,312 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-19 06:41:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:18,314 INFO L225 Difference]: With dead ends: 319 [2024-11-19 06:41:18,314 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 06:41:18,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:18,315 INFO L432 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-19 06:41:18,316 INFO L433 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-19 06:41:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 06:41:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 262. [2024-11-19 06:41:18,342 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-19 06:41:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 367 transitions. [2024-11-19 06:41:18,346 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 367 transitions. Word has length 7 [2024-11-19 06:41:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:18,346 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 367 transitions. [2024-11-19 06:41:18,347 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-19 06:41:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2024-11-19 06:41:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:18,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:18,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:18,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:41:18,349 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-19 06:41:18,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1280381812, now seen corresponding path program 1 times [2024-11-19 06:41:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118895965] [2024-11-19 06:41:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:18,483 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-19 06:41:18,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118895965] [2024-11-19 06:41:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118895965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:18,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377181] [2024-11-19 06:41:18,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:18,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:18,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:18,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:18,486 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-19 06:41:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:18,643 INFO L93 Difference]: Finished difference Result 318 states and 395 transitions. [2024-11-19 06:41:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:18,644 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-19 06:41:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:18,646 INFO L225 Difference]: With dead ends: 318 [2024-11-19 06:41:18,646 INFO L226 Difference]: Without dead ends: 318 [2024-11-19 06:41:18,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:18,649 INFO L432 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-19 06:41:18,650 INFO L433 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-19 06:41:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-19 06:41:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 262. [2024-11-19 06:41:18,671 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-19 06:41:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 367 transitions. [2024-11-19 06:41:18,674 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 367 transitions. Word has length 7 [2024-11-19 06:41:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 367 transitions. [2024-11-19 06:41:18,678 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-19 06:41:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2024-11-19 06:41:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:41:18,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:18,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:18,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:41:18,680 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-19 06:41:18,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash -251697362, now seen corresponding path program 1 times [2024-11-19 06:41:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608407916] [2024-11-19 06:41:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:18,826 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-19 06:41:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:18,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608407916] [2024-11-19 06:41:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608407916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:41:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678222422] [2024-11-19 06:41:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:18,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:18,830 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-19 06:41:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:18,974 INFO L93 Difference]: Finished difference Result 400 states and 533 transitions. [2024-11-19 06:41:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:41:18,976 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-19 06:41:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:18,979 INFO L225 Difference]: With dead ends: 400 [2024-11-19 06:41:18,979 INFO L226 Difference]: Without dead ends: 400 [2024-11-19 06:41:18,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:18,984 INFO L432 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-19 06:41:18,985 INFO L433 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-19 06:41:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-19 06:41:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 304. [2024-11-19 06:41:19,000 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-19 06:41:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 438 transitions. [2024-11-19 06:41:19,002 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 438 transitions. Word has length 10 [2024-11-19 06:41:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:19,002 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 438 transitions. [2024-11-19 06:41:19,003 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-19 06:41:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 438 transitions. [2024-11-19 06:41:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:41:19,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:19,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:19,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:41:19,004 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-19 06:41:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -249850320, now seen corresponding path program 1 times [2024-11-19 06:41:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672340156] [2024-11-19 06:41:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:19,118 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-19 06:41:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672340156] [2024-11-19 06:41:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672340156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:19,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:41:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251163146] [2024-11-19 06:41:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:19,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:19,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:19,120 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-19 06:41:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:19,257 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2024-11-19 06:41:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:41:19,258 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-19 06:41:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:19,260 INFO L225 Difference]: With dead ends: 390 [2024-11-19 06:41:19,260 INFO L226 Difference]: Without dead ends: 390 [2024-11-19 06:41:19,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:19,261 INFO L432 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-19 06:41:19,261 INFO L433 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-19 06:41:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-19 06:41:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 303. [2024-11-19 06:41:19,274 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-19 06:41:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 437 transitions. [2024-11-19 06:41:19,275 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 437 transitions. Word has length 10 [2024-11-19 06:41:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:19,276 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 437 transitions. [2024-11-19 06:41:19,276 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-19 06:41:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 437 transitions. [2024-11-19 06:41:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:41:19,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:19,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:41:19,277 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-19 06:41:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 787315061, now seen corresponding path program 1 times [2024-11-19 06:41:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123980497] [2024-11-19 06:41:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:19,303 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-19 06:41:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123980497] [2024-11-19 06:41:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123980497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:19,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547919333] [2024-11-19 06:41:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:19,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:19,305 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-19 06:41:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:19,413 INFO L93 Difference]: Finished difference Result 358 states and 488 transitions. [2024-11-19 06:41:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:19,414 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-19 06:41:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:19,415 INFO L225 Difference]: With dead ends: 358 [2024-11-19 06:41:19,415 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 06:41:19,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:19,416 INFO L432 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-19 06:41:19,417 INFO L433 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-19 06:41:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 06:41:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 300. [2024-11-19 06:41:19,438 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-19 06:41:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 432 transitions. [2024-11-19 06:41:19,441 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 432 transitions. Word has length 11 [2024-11-19 06:41:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:19,441 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 432 transitions. [2024-11-19 06:41:19,441 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-19 06:41:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 432 transitions. [2024-11-19 06:41:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:41:19,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:19,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:19,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:41:19,443 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-19 06:41:19,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1918130468, now seen corresponding path program 1 times [2024-11-19 06:41:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:19,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174046410] [2024-11-19 06:41:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:19,485 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-19 06:41:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174046410] [2024-11-19 06:41:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174046410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:19,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:19,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336879018] [2024-11-19 06:41:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:19,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:19,488 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-19 06:41:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:19,675 INFO L93 Difference]: Finished difference Result 396 states and 528 transitions. [2024-11-19 06:41:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:19,676 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-19 06:41:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:19,678 INFO L225 Difference]: With dead ends: 396 [2024-11-19 06:41:19,678 INFO L226 Difference]: Without dead ends: 396 [2024-11-19 06:41:19,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:19,679 INFO L432 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-19 06:41:19,679 INFO L433 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-19 06:41:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-19 06:41:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 300. [2024-11-19 06:41:19,685 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-19 06:41:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2024-11-19 06:41:19,687 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 13 [2024-11-19 06:41:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:19,687 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2024-11-19 06:41:19,687 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-19 06:41:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2024-11-19 06:41:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:41:19,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:19,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:19,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:41:19,689 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-19 06:41:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1918130467, now seen corresponding path program 1 times [2024-11-19 06:41:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522922676] [2024-11-19 06:41:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:19,809 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-19 06:41:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:19,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522922676] [2024-11-19 06:41:19,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522922676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:19,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:19,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:41:19,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978085351] [2024-11-19 06:41:19,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:19,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:19,811 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-19 06:41:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:20,013 INFO L93 Difference]: Finished difference Result 369 states and 472 transitions. [2024-11-19 06:41:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:20,014 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-19 06:41:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:20,016 INFO L225 Difference]: With dead ends: 369 [2024-11-19 06:41:20,016 INFO L226 Difference]: Without dead ends: 369 [2024-11-19 06:41:20,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:20,017 INFO L432 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-19 06:41:20,017 INFO L433 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-19 06:41:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-19 06:41:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 310. [2024-11-19 06:41:20,025 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-19 06:41:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 440 transitions. [2024-11-19 06:41:20,027 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 440 transitions. Word has length 13 [2024-11-19 06:41:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:20,027 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 440 transitions. [2024-11-19 06:41:20,027 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-19 06:41:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 440 transitions. [2024-11-19 06:41:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:41:20,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:20,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:20,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:41:20,029 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-19 06:41:20,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1917206946, now seen corresponding path program 1 times [2024-11-19 06:41:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:20,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745265266] [2024-11-19 06:41:20,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:20,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:20,124 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-19 06:41:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745265266] [2024-11-19 06:41:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745265266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:20,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:20,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:41:20,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886900129] [2024-11-19 06:41:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:20,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:20,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:20,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:20,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:20,127 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-19 06:41:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:20,353 INFO L93 Difference]: Finished difference Result 368 states and 470 transitions. [2024-11-19 06:41:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:20,354 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-19 06:41:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:20,357 INFO L225 Difference]: With dead ends: 368 [2024-11-19 06:41:20,357 INFO L226 Difference]: Without dead ends: 368 [2024-11-19 06:41:20,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:20,359 INFO L432 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-19 06:41:20,359 INFO L433 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-19 06:41:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-19 06:41:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 304. [2024-11-19 06:41:20,371 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-19 06:41:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 431 transitions. [2024-11-19 06:41:20,373 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 431 transitions. Word has length 13 [2024-11-19 06:41:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:20,373 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 431 transitions. [2024-11-19 06:41:20,373 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-19 06:41:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 431 transitions. [2024-11-19 06:41:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:41:20,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:20,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:41:20,375 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-19 06:41:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 398929757, now seen corresponding path program 1 times [2024-11-19 06:41:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904986498] [2024-11-19 06:41:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:20,458 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-19 06:41:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904986498] [2024-11-19 06:41:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904986498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:20,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:20,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156927307] [2024-11-19 06:41:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:20,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:20,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:20,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:20,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:20,460 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-19 06:41:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:20,628 INFO L93 Difference]: Finished difference Result 396 states and 526 transitions. [2024-11-19 06:41:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:20,628 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-19 06:41:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:20,630 INFO L225 Difference]: With dead ends: 396 [2024-11-19 06:41:20,630 INFO L226 Difference]: Without dead ends: 396 [2024-11-19 06:41:20,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:20,631 INFO L432 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-19 06:41:20,631 INFO L433 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-19 06:41:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-19 06:41:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 310. [2024-11-19 06:41:20,640 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-19 06:41:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2024-11-19 06:41:20,643 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 15 [2024-11-19 06:41:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:20,643 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2024-11-19 06:41:20,643 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-19 06:41:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2024-11-19 06:41:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:41:20,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:20,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:41:20,645 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-19 06:41:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 398929758, now seen corresponding path program 1 times [2024-11-19 06:41:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44794651] [2024-11-19 06:41:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:20,728 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-19 06:41:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44794651] [2024-11-19 06:41:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44794651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:20,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378133477] [2024-11-19 06:41:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:20,731 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-19 06:41:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:20,896 INFO L93 Difference]: Finished difference Result 359 states and 449 transitions. [2024-11-19 06:41:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:20,896 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-19 06:41:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:20,898 INFO L225 Difference]: With dead ends: 359 [2024-11-19 06:41:20,898 INFO L226 Difference]: Without dead ends: 359 [2024-11-19 06:41:20,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:20,898 INFO L432 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-19 06:41:20,899 INFO L433 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-19 06:41:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-19 06:41:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 310. [2024-11-19 06:41:20,905 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-19 06:41:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 428 transitions. [2024-11-19 06:41:20,906 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 428 transitions. Word has length 15 [2024-11-19 06:41:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:20,906 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 428 transitions. [2024-11-19 06:41:20,906 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-19 06:41:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 428 transitions. [2024-11-19 06:41:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:41:20,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:20,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:20,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:41:20,907 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-19 06:41:20,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:20,908 INFO L85 PathProgramCache]: Analyzing trace with hash 688488293, now seen corresponding path program 1 times [2024-11-19 06:41:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:20,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813549021] [2024-11-19 06:41:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:20,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:20,960 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-19 06:41:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813549021] [2024-11-19 06:41:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813549021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:20,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027432830] [2024-11-19 06:41:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:20,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:20,962 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-19 06:41:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:21,034 INFO L93 Difference]: Finished difference Result 307 states and 422 transitions. [2024-11-19 06:41:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:21,035 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-19 06:41:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:21,036 INFO L225 Difference]: With dead ends: 307 [2024-11-19 06:41:21,036 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 06:41:21,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:21,037 INFO L432 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-19 06:41:21,037 INFO L433 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-19 06:41:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 06:41:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-19 06:41:21,046 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-19 06:41:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 422 transitions. [2024-11-19 06:41:21,048 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 422 transitions. Word has length 19 [2024-11-19 06:41:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:21,048 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 422 transitions. [2024-11-19 06:41:21,048 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-19 06:41:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 422 transitions. [2024-11-19 06:41:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:41:21,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:21,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:21,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:41:21,050 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-19 06:41:21,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash 688488294, now seen corresponding path program 1 times [2024-11-19 06:41:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004051744] [2024-11-19 06:41:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:21,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:21,124 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-19 06:41:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004051744] [2024-11-19 06:41:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004051744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:21,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:21,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:21,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048238981] [2024-11-19 06:41:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:21,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:21,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:21,127 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-19 06:41:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:21,193 INFO L93 Difference]: Finished difference Result 310 states and 424 transitions. [2024-11-19 06:41:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:21,193 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-19 06:41:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:21,195 INFO L225 Difference]: With dead ends: 310 [2024-11-19 06:41:21,195 INFO L226 Difference]: Without dead ends: 310 [2024-11-19 06:41:21,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 06:41:21,195 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:21,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 244 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-19 06:41:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-19 06:41:21,204 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-19 06:41:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 424 transitions. [2024-11-19 06:41:21,206 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 424 transitions. Word has length 19 [2024-11-19 06:41:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:21,206 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 424 transitions. [2024-11-19 06:41:21,206 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-19 06:41:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 424 transitions. [2024-11-19 06:41:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:41:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:21,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:21,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:41:21,208 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-19 06:41:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -131699369, now seen corresponding path program 1 times [2024-11-19 06:41:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510776510] [2024-11-19 06:41:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:21,303 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-19 06:41:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510776510] [2024-11-19 06:41:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510776510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:41:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519260135] [2024-11-19 06:41:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:21,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:41:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:41:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:21,305 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-19 06:41:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:21,336 INFO L93 Difference]: Finished difference Result 316 states and 430 transitions. [2024-11-19 06:41:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:41:21,336 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-19 06:41:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:21,338 INFO L225 Difference]: With dead ends: 316 [2024-11-19 06:41:21,338 INFO L226 Difference]: Without dead ends: 316 [2024-11-19 06:41:21,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:21,338 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 11 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:21,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 420 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-19 06:41:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2024-11-19 06:41:21,346 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-19 06:41:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 426 transitions. [2024-11-19 06:41:21,348 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 426 transitions. Word has length 20 [2024-11-19 06:41:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:21,348 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 426 transitions. [2024-11-19 06:41:21,349 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-19 06:41:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 426 transitions. [2024-11-19 06:41:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:41:21,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:21,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:21,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:41:21,353 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-19 06:41:21,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash -131643665, now seen corresponding path program 1 times [2024-11-19 06:41:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268325286] [2024-11-19 06:41:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:21,445 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-19 06:41:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268325286] [2024-11-19 06:41:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268325286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:21,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979141752] [2024-11-19 06:41:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:21,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:21,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:21,448 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-19 06:41:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:21,513 INFO L93 Difference]: Finished difference Result 362 states and 490 transitions. [2024-11-19 06:41:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:21,513 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-19 06:41:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:21,515 INFO L225 Difference]: With dead ends: 362 [2024-11-19 06:41:21,515 INFO L226 Difference]: Without dead ends: 362 [2024-11-19 06:41:21,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 06:41:21,516 INFO L432 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-19 06:41:21,516 INFO L433 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-19 06:41:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-19 06:41:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 338. [2024-11-19 06:41:21,523 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-19 06:41:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 461 transitions. [2024-11-19 06:41:21,526 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 461 transitions. Word has length 20 [2024-11-19 06:41:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:21,526 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 461 transitions. [2024-11-19 06:41:21,526 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-19 06:41:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2024-11-19 06:41:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:41:21,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:21,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:41:21,527 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-19 06:41:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2560946, now seen corresponding path program 1 times [2024-11-19 06:41:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750419072] [2024-11-19 06:41:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:21,614 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-19 06:41:21,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750419072] [2024-11-19 06:41:21,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750419072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:21,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463452799] [2024-11-19 06:41:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:21,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:21,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:21,616 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-19 06:41:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:21,686 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-11-19 06:41:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:21,687 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-19 06:41:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:21,690 INFO L225 Difference]: With dead ends: 342 [2024-11-19 06:41:21,690 INFO L226 Difference]: Without dead ends: 342 [2024-11-19 06:41:21,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 06:41:21,690 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:21,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 245 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-19 06:41:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-19 06:41:21,698 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-19 06:41:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 465 transitions. [2024-11-19 06:41:21,700 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 465 transitions. Word has length 20 [2024-11-19 06:41:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 465 transitions. [2024-11-19 06:41:21,701 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-19 06:41:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 465 transitions. [2024-11-19 06:41:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:41:21,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:21,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:21,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:41:21,701 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-19 06:41:21,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2559024, now seen corresponding path program 1 times [2024-11-19 06:41:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857910196] [2024-11-19 06:41:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:21,759 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-19 06:41:21,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:21,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857910196] [2024-11-19 06:41:21,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857910196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:21,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:21,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218949809] [2024-11-19 06:41:21,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:21,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:21,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:21,761 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-19 06:41:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:21,830 INFO L93 Difference]: Finished difference Result 375 states and 504 transitions. [2024-11-19 06:41:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:21,831 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-19 06:41:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:21,832 INFO L225 Difference]: With dead ends: 375 [2024-11-19 06:41:21,832 INFO L226 Difference]: Without dead ends: 375 [2024-11-19 06:41:21,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 06:41:21,833 INFO L432 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-19 06:41:21,833 INFO L433 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-19 06:41:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-19 06:41:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 337. [2024-11-19 06:41:21,840 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-19 06:41:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 457 transitions. [2024-11-19 06:41:21,841 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 457 transitions. Word has length 20 [2024-11-19 06:41:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:21,842 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 457 transitions. [2024-11-19 06:41:21,842 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-19 06:41:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 457 transitions. [2024-11-19 06:41:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:41:21,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:21,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:21,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:41:21,844 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-19 06:41:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash 59872289, now seen corresponding path program 1 times [2024-11-19 06:41:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879345295] [2024-11-19 06:41:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:22,131 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-19 06:41:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:22,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879345295] [2024-11-19 06:41:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879345295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:41:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483908023] [2024-11-19 06:41:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:22,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:22,133 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-19 06:41:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:22,446 INFO L93 Difference]: Finished difference Result 416 states and 525 transitions. [2024-11-19 06:41:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:22,446 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-19 06:41:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:22,448 INFO L225 Difference]: With dead ends: 416 [2024-11-19 06:41:22,448 INFO L226 Difference]: Without dead ends: 416 [2024-11-19 06:41:22,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-19 06:41:22,449 INFO L432 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-19 06:41:22,449 INFO L433 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-19 06:41:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-19 06:41:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 331. [2024-11-19 06:41:22,455 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-19 06:41:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 446 transitions. [2024-11-19 06:41:22,457 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 446 transitions. Word has length 21 [2024-11-19 06:41:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:22,457 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 446 transitions. [2024-11-19 06:41:22,457 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-19 06:41:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 446 transitions. [2024-11-19 06:41:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:41:22,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:22,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:41:22,458 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-19 06:41:22,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -79389329, now seen corresponding path program 1 times [2024-11-19 06:41:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376445495] [2024-11-19 06:41:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:22,525 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-19 06:41:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376445495] [2024-11-19 06:41:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376445495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:22,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508399824] [2024-11-19 06:41:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:22,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:22,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:22,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:22,527 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-19 06:41:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:22,622 INFO L93 Difference]: Finished difference Result 334 states and 448 transitions. [2024-11-19 06:41:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:22,624 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-19 06:41:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:22,625 INFO L225 Difference]: With dead ends: 334 [2024-11-19 06:41:22,625 INFO L226 Difference]: Without dead ends: 334 [2024-11-19 06:41:22,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 06:41:22,626 INFO L432 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-19 06:41:22,626 INFO L433 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-19 06:41:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-19 06:41:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 324. [2024-11-19 06:41:22,634 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-19 06:41:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 438 transitions. [2024-11-19 06:41:22,635 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 438 transitions. Word has length 21 [2024-11-19 06:41:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:22,636 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 438 transitions. [2024-11-19 06:41:22,636 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-19 06:41:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 438 transitions. [2024-11-19 06:41:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:41:22,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:22,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:22,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:41:22,637 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-19 06:41:22,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1710334668, now seen corresponding path program 1 times [2024-11-19 06:41:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429107617] [2024-11-19 06:41:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:22,691 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-19 06:41:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429107617] [2024-11-19 06:41:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429107617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:41:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826813076] [2024-11-19 06:41:22,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:22,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:41:22,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:22,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:41:22,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:22,694 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-19 06:41:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:22,808 INFO L93 Difference]: Finished difference Result 329 states and 437 transitions. [2024-11-19 06:41:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:41:22,808 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-19 06:41:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:22,810 INFO L225 Difference]: With dead ends: 329 [2024-11-19 06:41:22,810 INFO L226 Difference]: Without dead ends: 329 [2024-11-19 06:41:22,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 06:41:22,811 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 30 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:22,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 369 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-19 06:41:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2024-11-19 06:41:22,816 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-19 06:41:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 429 transitions. [2024-11-19 06:41:22,818 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 429 transitions. Word has length 23 [2024-11-19 06:41:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:22,818 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 429 transitions. [2024-11-19 06:41:22,818 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-19 06:41:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 429 transitions. [2024-11-19 06:41:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:41:22,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:22,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:22,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:41:22,819 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-19 06:41:22,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1710334669, now seen corresponding path program 1 times [2024-11-19 06:41:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:22,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126248949] [2024-11-19 06:41:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:22,984 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-19 06:41:22,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126248949] [2024-11-19 06:41:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126248949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:41:22,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149402718] [2024-11-19 06:41:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:22,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:22,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:22,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:22,987 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-19 06:41:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:23,141 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2024-11-19 06:41:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:23,141 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-19 06:41:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:23,144 INFO L225 Difference]: With dead ends: 247 [2024-11-19 06:41:23,144 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 06:41:23,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-19 06:41:23,144 INFO L432 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-19 06:41:23,145 INFO L433 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-19 06:41:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 06:41:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 225. [2024-11-19 06:41:23,149 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-19 06:41:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 274 transitions. [2024-11-19 06:41:23,150 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 274 transitions. Word has length 23 [2024-11-19 06:41:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:23,151 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 274 transitions. [2024-11-19 06:41:23,151 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-19 06:41:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 274 transitions. [2024-11-19 06:41:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:41:23,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:23,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:23,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:41:23,153 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-19 06:41:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2045900250, now seen corresponding path program 1 times [2024-11-19 06:41:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530649886] [2024-11-19 06:41:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:23,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530649886] [2024-11-19 06:41:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530649886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:23,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:23,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:41:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88447907] [2024-11-19 06:41:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:23,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:23,385 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-19 06:41:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:23,570 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2024-11-19 06:41:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:41:23,571 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-19 06:41:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:23,572 INFO L225 Difference]: With dead ends: 256 [2024-11-19 06:41:23,572 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 06:41:23,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:41:23,573 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:23,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 779 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 06:41:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 235. [2024-11-19 06:41:23,577 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-19 06:41:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2024-11-19 06:41:23,578 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 24 [2024-11-19 06:41:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:23,578 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2024-11-19 06:41:23,578 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-19 06:41:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2024-11-19 06:41:23,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:41:23,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:23,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:23,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:41:23,579 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-19 06:41:23,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1535366073, now seen corresponding path program 1 times [2024-11-19 06:41:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529054049] [2024-11-19 06:41:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:23,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:23,711 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-19 06:41:23,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529054049] [2024-11-19 06:41:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529054049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:23,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777382757] [2024-11-19 06:41:23,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:23,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:23,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:23,713 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-19 06:41:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:23,768 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2024-11-19 06:41:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:23,769 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-19 06:41:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:23,770 INFO L225 Difference]: With dead ends: 259 [2024-11-19 06:41:23,770 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 06:41:23,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 06:41:23,770 INFO L432 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-19 06:41:23,771 INFO L433 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-19 06:41:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 06:41:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2024-11-19 06:41:23,776 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-19 06:41:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2024-11-19 06:41:23,778 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 24 [2024-11-19 06:41:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:23,778 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2024-11-19 06:41:23,778 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-19 06:41:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2024-11-19 06:41:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:41:23,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:23,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:23,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:41:23,780 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-19 06:41:23,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1674205682, now seen corresponding path program 1 times [2024-11-19 06:41:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:23,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137472420] [2024-11-19 06:41:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:24,050 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-19 06:41:24,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137472420] [2024-11-19 06:41:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137472420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:24,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:24,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:41:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236774501] [2024-11-19 06:41:24,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:24,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:24,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:24,051 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-19 06:41:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:24,253 INFO L93 Difference]: Finished difference Result 253 states and 301 transitions. [2024-11-19 06:41:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:41:24,253 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-19 06:41:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:24,254 INFO L225 Difference]: With dead ends: 253 [2024-11-19 06:41:24,254 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 06:41:24,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:41:24,255 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 53 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:24,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 921 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 06:41:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2024-11-19 06:41:24,260 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-19 06:41:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 287 transitions. [2024-11-19 06:41:24,261 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 287 transitions. Word has length 25 [2024-11-19 06:41:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:24,262 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 287 transitions. [2024-11-19 06:41:24,262 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-19 06:41:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 287 transitions. [2024-11-19 06:41:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:41:24,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:24,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:24,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 06:41:24,264 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-19 06:41:24,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash -984725155, now seen corresponding path program 1 times [2024-11-19 06:41:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891233341] [2024-11-19 06:41:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891233341] [2024-11-19 06:41:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891233341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:24,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539475315] [2024-11-19 06:41:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:24,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:24,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:24,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:24,510 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-19 06:41:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:24,814 INFO L93 Difference]: Finished difference Result 431 states and 519 transitions. [2024-11-19 06:41:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:24,814 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-19 06:41:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:24,816 INFO L225 Difference]: With dead ends: 431 [2024-11-19 06:41:24,816 INFO L226 Difference]: Without dead ends: 431 [2024-11-19 06:41:24,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:41:24,817 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:24,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 609 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-19 06:41:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 367. [2024-11-19 06:41:24,823 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-19 06:41:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 484 transitions. [2024-11-19 06:41:24,824 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 484 transitions. Word has length 26 [2024-11-19 06:41:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:24,825 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 484 transitions. [2024-11-19 06:41:24,825 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-19 06:41:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 484 transitions. [2024-11-19 06:41:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:41:24,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:24,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:24,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 06:41:24,826 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-19 06:41:24,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:24,826 INFO L85 PathProgramCache]: Analyzing trace with hash -461708714, now seen corresponding path program 1 times [2024-11-19 06:41:24,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:24,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711339263] [2024-11-19 06:41:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:24,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:24,929 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-19 06:41:24,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711339263] [2024-11-19 06:41:24,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711339263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:24,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:24,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:41:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131235022] [2024-11-19 06:41:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:24,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:24,932 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-19 06:41:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:25,078 INFO L93 Difference]: Finished difference Result 396 states and 514 transitions. [2024-11-19 06:41:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:25,078 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-19 06:41:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:25,080 INFO L225 Difference]: With dead ends: 396 [2024-11-19 06:41:25,080 INFO L226 Difference]: Without dead ends: 396 [2024-11-19 06:41:25,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:41:25,081 INFO L432 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-19 06:41:25,081 INFO L433 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-19 06:41:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-19 06:41:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 388. [2024-11-19 06:41:25,087 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-19 06:41:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 510 transitions. [2024-11-19 06:41:25,089 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 510 transitions. Word has length 27 [2024-11-19 06:41:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:25,089 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 510 transitions. [2024-11-19 06:41:25,089 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-19 06:41:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 510 transitions. [2024-11-19 06:41:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:41:25,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:25,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:25,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 06:41:25,090 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-19 06:41:25,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:25,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1700919435, now seen corresponding path program 1 times [2024-11-19 06:41:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862421502] [2024-11-19 06:41:25,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:25,446 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-19 06:41:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862421502] [2024-11-19 06:41:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862421502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:25,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:41:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218252528] [2024-11-19 06:41:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:25,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:41:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:41:25,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:25,449 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-19 06:41:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:25,896 INFO L93 Difference]: Finished difference Result 574 states and 736 transitions. [2024-11-19 06:41:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:25,896 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-19 06:41:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:25,898 INFO L225 Difference]: With dead ends: 574 [2024-11-19 06:41:25,899 INFO L226 Difference]: Without dead ends: 574 [2024-11-19 06:41:25,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:41:25,900 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 169 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-19 06:41:25,900 INFO L433 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-19 06:41:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-19 06:41:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 511. [2024-11-19 06:41:25,909 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-19 06:41:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 701 transitions. [2024-11-19 06:41:25,911 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 701 transitions. Word has length 27 [2024-11-19 06:41:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:25,911 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 701 transitions. [2024-11-19 06:41:25,912 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-19 06:41:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 701 transitions. [2024-11-19 06:41:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:41:25,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:25,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:25,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:41:25,913 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-19 06:41:25,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1188894914, now seen corresponding path program 1 times [2024-11-19 06:41:25,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:25,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966137386] [2024-11-19 06:41:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,017 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-19 06:41:26,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:26,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966137386] [2024-11-19 06:41:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966137386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:26,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:26,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:41:26,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682289271] [2024-11-19 06:41:26,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:26,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:26,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:26,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:26,020 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-19 06:41:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:26,196 INFO L93 Difference]: Finished difference Result 528 states and 714 transitions. [2024-11-19 06:41:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:26,197 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-19 06:41:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:26,199 INFO L225 Difference]: With dead ends: 528 [2024-11-19 06:41:26,199 INFO L226 Difference]: Without dead ends: 528 [2024-11-19 06:41:26,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:41:26,200 INFO L432 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-19 06:41:26,200 INFO L433 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-19 06:41:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-19 06:41:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 520. [2024-11-19 06:41:26,208 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-19 06:41:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 710 transitions. [2024-11-19 06:41:26,210 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 710 transitions. Word has length 28 [2024-11-19 06:41:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:26,210 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 710 transitions. [2024-11-19 06:41:26,210 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-19 06:41:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 710 transitions. [2024-11-19 06:41:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:41:26,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:26,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:26,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 06:41:26,213 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-19 06:41:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1320441736, now seen corresponding path program 1 times [2024-11-19 06:41:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:26,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183866703] [2024-11-19 06:41:26,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,435 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-19 06:41:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:26,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183866703] [2024-11-19 06:41:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183866703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229971222] [2024-11-19 06:41:26,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:26,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:26,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:26,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:26,438 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-19 06:41:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:26,601 INFO L93 Difference]: Finished difference Result 519 states and 690 transitions. [2024-11-19 06:41:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:26,602 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-19 06:41:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:26,604 INFO L225 Difference]: With dead ends: 519 [2024-11-19 06:41:26,604 INFO L226 Difference]: Without dead ends: 519 [2024-11-19 06:41:26,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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-19 06:41:26,605 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 183 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 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-19 06:41:26,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 242 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-19 06:41:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 481. [2024-11-19 06:41:26,614 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-19 06:41:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 640 transitions. [2024-11-19 06:41:26,616 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 640 transitions. Word has length 29 [2024-11-19 06:41:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:26,616 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 640 transitions. [2024-11-19 06:41:26,616 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-19 06:41:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 640 transitions. [2024-11-19 06:41:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:41:26,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:26,617 INFO L215 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-19 06:41:26,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 06:41:26,618 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-19 06:41:26,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1684807341, now seen corresponding path program 1 times [2024-11-19 06:41:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:26,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338203405] [2024-11-19 06:41:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,816 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-19 06:41:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338203405] [2024-11-19 06:41:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338203405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970918058] [2024-11-19 06:41:26,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:26,819 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-19 06:41:26,821 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-19 06:41:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:41:26,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:27,315 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-19 06:41:27,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:27,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:41:27,487 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-19 06:41:27,679 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-19 06:41:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970918058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:27,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:41:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2024-11-19 06:41:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254751854] [2024-11-19 06:41:27,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:41:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:41:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:41:27,682 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-19 06:41:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:28,055 INFO L93 Difference]: Finished difference Result 508 states and 664 transitions. [2024-11-19 06:41:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:41:28,055 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-19 06:41:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:28,057 INFO L225 Difference]: With dead ends: 508 [2024-11-19 06:41:28,057 INFO L226 Difference]: Without dead ends: 508 [2024-11-19 06:41:28,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:41:28,058 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 573 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:28,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 789 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:41:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-19 06:41:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 379. [2024-11-19 06:41:28,068 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-19 06:41:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 481 transitions. [2024-11-19 06:41:28,069 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 481 transitions. Word has length 40 [2024-11-19 06:41:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:28,069 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 481 transitions. [2024-11-19 06:41:28,070 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-19 06:41:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 481 transitions. [2024-11-19 06:41:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:41:28,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:28,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:28,090 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-19 06:41:28,275 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-19 06:41:28,276 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-19 06:41:28,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1517564365, now seen corresponding path program 1 times [2024-11-19 06:41:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:28,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694881151] [2024-11-19 06:41:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:28,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:28,518 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-19 06:41:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694881151] [2024-11-19 06:41:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694881151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146055666] [2024-11-19 06:41:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:28,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:28,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:28,521 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-19 06:41:28,522 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-19 06:41:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:28,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:41:28,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:28,939 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-19 06:41:28,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146055666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:28,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:41:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2024-11-19 06:41:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320348660] [2024-11-19 06:41:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:28,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:41:28,942 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-19 06:41:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:29,083 INFO L93 Difference]: Finished difference Result 386 states and 488 transitions. [2024-11-19 06:41:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:41:29,084 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-19 06:41:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:29,085 INFO L225 Difference]: With dead ends: 386 [2024-11-19 06:41:29,085 INFO L226 Difference]: Without dead ends: 386 [2024-11-19 06:41:29,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:41:29,086 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 242 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:29,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 311 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-19 06:41:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2024-11-19 06:41:29,094 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-19 06:41:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 484 transitions. [2024-11-19 06:41:29,095 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 484 transitions. Word has length 40 [2024-11-19 06:41:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:29,096 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 484 transitions. [2024-11-19 06:41:29,096 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-19 06:41:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 484 transitions. [2024-11-19 06:41:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:41:29,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:29,096 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:29,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:29,300 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-19 06:41:29,301 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-19 06:41:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1517564303, now seen corresponding path program 1 times [2024-11-19 06:41:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:29,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908352311] [2024-11-19 06:41:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:29,451 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-19 06:41:29,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:29,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908352311] [2024-11-19 06:41:29,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908352311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:29,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102113075] [2024-11-19 06:41:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:29,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:29,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:29,454 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-19 06:41:29,456 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-19 06:41:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:29,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:41:29,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:29,827 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-19 06:41:29,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102113075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:29,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:41:29,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2024-11-19 06:41:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433913435] [2024-11-19 06:41:29,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:29,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:29,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:29,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:29,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:41:29,829 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-19 06:41:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:29,938 INFO L93 Difference]: Finished difference Result 385 states and 486 transitions. [2024-11-19 06:41:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:41:29,938 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-19 06:41:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:29,940 INFO L225 Difference]: With dead ends: 385 [2024-11-19 06:41:29,940 INFO L226 Difference]: Without dead ends: 385 [2024-11-19 06:41:29,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 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-19 06:41:29,940 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 155 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:29,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 242 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-19 06:41:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 378. [2024-11-19 06:41:29,947 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-19 06:41:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 479 transitions. [2024-11-19 06:41:29,948 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 479 transitions. Word has length 40 [2024-11-19 06:41:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:29,948 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 479 transitions. [2024-11-19 06:41:29,948 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-19 06:41:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 479 transitions. [2024-11-19 06:41:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:41:29,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:29,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:29,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:30,149 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-19 06:41:30,149 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-19 06:41:30,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1078522670, now seen corresponding path program 1 times [2024-11-19 06:41:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:30,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301983077] [2024-11-19 06:41:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:30,361 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-19 06:41:30,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:30,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301983077] [2024-11-19 06:41:30,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301983077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:30,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:30,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:41:30,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708840413] [2024-11-19 06:41:30,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:30,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:30,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:30,364 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-19 06:41:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:30,511 INFO L93 Difference]: Finished difference Result 380 states and 475 transitions. [2024-11-19 06:41:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:41:30,512 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-19 06:41:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:30,513 INFO L225 Difference]: With dead ends: 380 [2024-11-19 06:41:30,513 INFO L226 Difference]: Without dead ends: 380 [2024-11-19 06:41:30,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-19 06:41:30,514 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 130 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:30,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 314 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-19 06:41:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2024-11-19 06:41:30,525 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-19 06:41:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 471 transitions. [2024-11-19 06:41:30,526 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 471 transitions. Word has length 42 [2024-11-19 06:41:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 471 transitions. [2024-11-19 06:41:30,526 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-19 06:41:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 471 transitions. [2024-11-19 06:41:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:41:30,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:30,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:30,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 06:41:30,528 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-19 06:41:30,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash -934084823, now seen corresponding path program 1 times [2024-11-19 06:41:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:30,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703295200] [2024-11-19 06:41:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:31,357 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-19 06:41:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703295200] [2024-11-19 06:41:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703295200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:31,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 06:41:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404750713] [2024-11-19 06:41:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:31,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:41:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:31,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:41:31,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:41:31,359 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-19 06:41:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:31,758 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2024-11-19 06:41:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:41:31,758 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-19 06:41:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:31,760 INFO L225 Difference]: With dead ends: 394 [2024-11-19 06:41:31,760 INFO L226 Difference]: Without dead ends: 394 [2024-11-19 06:41:31,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:41:31,761 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 49 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:31,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 630 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-19 06:41:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 390. [2024-11-19 06:41:31,768 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-19 06:41:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 487 transitions. [2024-11-19 06:41:31,769 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 487 transitions. Word has length 43 [2024-11-19 06:41:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:31,769 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 487 transitions. [2024-11-19 06:41:31,769 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-19 06:41:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 487 transitions. [2024-11-19 06:41:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:41:31,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:31,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:31,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 06:41:31,771 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-19 06:41:31,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1138243033, now seen corresponding path program 1 times [2024-11-19 06:41:31,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:31,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880030121] [2024-11-19 06:41:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:31,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:32,235 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-19 06:41:32,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880030121] [2024-11-19 06:41:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880030121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:32,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:32,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:41:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483314950] [2024-11-19 06:41:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:32,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:41:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:41:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:41:32,237 INFO L87 Difference]: Start difference. First operand 390 states and 487 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 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-19 06:41:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:32,426 INFO L93 Difference]: Finished difference Result 405 states and 500 transitions. [2024-11-19 06:41:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:41:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 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-19 06:41:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:32,428 INFO L225 Difference]: With dead ends: 405 [2024-11-19 06:41:32,428 INFO L226 Difference]: Without dead ends: 405 [2024-11-19 06:41:32,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:41:32,429 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 142 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:32,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1055 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-19 06:41:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 394. [2024-11-19 06:41:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 342 states have (on average 1.345029239766082) internal successors, (460), 375 states have internal predecessors, (460), 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-19 06:41:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2024-11-19 06:41:32,436 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 44 [2024-11-19 06:41:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:32,436 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2024-11-19 06:41:32,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 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-19 06:41:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2024-11-19 06:41:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:41:32,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:32,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:32,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 06:41:32,437 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-19 06:41:32,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:32,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1516678113, now seen corresponding path program 1 times [2024-11-19 06:41:32,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:32,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268734178] [2024-11-19 06:41:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:33,269 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-19 06:41:33,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:33,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268734178] [2024-11-19 06:41:33,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268734178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:33,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707772356] [2024-11-19 06:41:33,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:33,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:33,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:33,274 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-19 06:41:33,276 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-19 06:41:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:33,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 06:41:33,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:33,572 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-19 06:41:33,965 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-19 06:41:33,966 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 23 treesize of output 30 [2024-11-19 06:41:33,989 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-19 06:41:33,989 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 23 treesize of output 30 [2024-11-19 06:41:34,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:34,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:34,486 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-19 06:41:34,487 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 120 treesize of output 114 [2024-11-19 06:41:34,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:34,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:34,530 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-19 06:41:34,531 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 112 treesize of output 106 [2024-11-19 06:41:35,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:41:35,178 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 105 treesize of output 101 [2024-11-19 06:41:35,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:41:35,209 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 75 treesize of output 71 [2024-11-19 06:41:35,487 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-19 06:41:35,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:43,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:41:43,532 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 [2024-11-19 06:42:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707772356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:06,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:06,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2024-11-19 06:42:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266649571] [2024-11-19 06:42:06,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:06,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:42:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:06,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:42:06,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1463, Unknown=3, NotChecked=0, Total=1640 [2024-11-19 06:42:06,092 INFO L87 Difference]: Start difference. First operand 394 states and 490 transitions. Second operand has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:11,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:42:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:15,061 INFO L93 Difference]: Finished difference Result 626 states and 757 transitions. [2024-11-19 06:42:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:42:15,061 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-19 06:42:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:15,063 INFO L225 Difference]: With dead ends: 626 [2024-11-19 06:42:15,063 INFO L226 Difference]: Without dead ends: 626 [2024-11-19 06:42:15,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=488, Invalid=4201, Unknown=3, NotChecked=0, Total=4692 [2024-11-19 06:42:15,067 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 388 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:15,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2114 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1578 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-11-19 06:42:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-19 06:42:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 454. [2024-11-19 06:42:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 395 states have (on average 1.3367088607594937) internal successors, (528), 431 states have internal predecessors, (528), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 15 states have call predecessors, (28), 14 states have call successors, (28) [2024-11-19 06:42:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 570 transitions. [2024-11-19 06:42:15,081 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 570 transitions. Word has length 44 [2024-11-19 06:42:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 570 transitions. [2024-11-19 06:42:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 570 transitions. [2024-11-19 06:42:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:42:15,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:15,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:15,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:42:15,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-19 06:42:15,287 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-11-19 06:42:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1516678114, now seen corresponding path program 1 times [2024-11-19 06:42:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726358170] [2024-11-19 06:42:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:16,328 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-19 06:42:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726358170] [2024-11-19 06:42:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726358170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582204427] [2024-11-19 06:42:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:16,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:16,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:16,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:42:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:16,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:42:16,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:16,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:42:16,865 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-19 06:42:16,865 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 23 treesize of output 30 [2024-11-19 06:42:16,876 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 06:42:16,877 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 23 treesize of output 22 [2024-11-19 06:42:17,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:17,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:17,194 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-19 06:42:17,195 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 86 treesize of output 80 [2024-11-19 06:42:17,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:17,215 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-11-19 06:42:17,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 85 [2024-11-19 06:42:17,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:17,644 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 83 treesize of output 79 [2024-11-19 06:42:17,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:17,666 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 53 treesize of output 65 [2024-11-19 06:42:17,890 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-19 06:42:17,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:32,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:32,876 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 339 treesize of output 344