./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all.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/list-simple/sll2c_remove_all.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 cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:01:51,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:01:51,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:01:51,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:01:51,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:01:51,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:01:51,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:01:51,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:01:51,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:01:51,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:01:51,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:01:51,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:01:51,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:01:51,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:01:51,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:01:51,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:01:51,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:01:51,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:01:51,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:01:51,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:01:51,255 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:01:51,259 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:01:51,260 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:01:51,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:01:51,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:01:51,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:01:51,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:01:51,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:01:51,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:01:51,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:01:51,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:01:51,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:01:51,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:01:51,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:01:51,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:01:51,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:01:51,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:01:51,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:01:51,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:01:51,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:01:51,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:01:51,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:01:51,268 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 -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2024-11-19 07:01:51,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:01:51,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:01:51,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:01:51,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:01:51,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:01:51,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-19 07:01:53,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:01:53,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:01:53,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-19 07:01:53,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571822b01/f8c8ac3f4bf3471286ada035864c218f/FLAGd74c18b72 [2024-11-19 07:01:53,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/571822b01/f8c8ac3f4bf3471286ada035864c218f [2024-11-19 07:01:53,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:01:53,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:01:53,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:01:53,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:01:53,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:01:53,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55aba2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53, skipping insertion in model container [2024-11-19 07:01:53,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:01:53,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:01:53,784 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:01:53,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:01:53,872 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:01:53,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53 WrapperNode [2024-11-19 07:01:53,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:01:53,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:01:53,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:01:53,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:01:53,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,926 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-11-19 07:01:53,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:01:53,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:01:53,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:01:53,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:01:53,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,972 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 7 writes are split as follows [0, 5, 2]. [2024-11-19 07:01:53,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:53,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:01:54,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:01:54,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:01:54,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:01:54,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (1/1) ... [2024-11-19 07:01:54,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:01:54,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:54,039 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 07:01:54,041 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 07:01:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 07:01:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 07:01:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 07:01:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 07:01:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 07:01:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 07:01:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 07:01:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:01:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 07:01:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 07:01:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 07:01:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:01:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 07:01:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 07:01:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:01:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:01:54,199 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:01:54,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:01:54,616 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-19 07:01:54,618 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:01:54,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:01:54,634 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 07:01:54,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:01:54 BoogieIcfgContainer [2024-11-19 07:01:54,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:01:54,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:01:54,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:01:54,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:01:54,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:01:53" (1/3) ... [2024-11-19 07:01:54,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adfc174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:01:54, skipping insertion in model container [2024-11-19 07:01:54,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:53" (2/3) ... [2024-11-19 07:01:54,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adfc174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:01:54, skipping insertion in model container [2024-11-19 07:01:54,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:01:54" (3/3) ... [2024-11-19 07:01:54,643 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2024-11-19 07:01:54,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:01:54,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-19 07:01:54,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:01:54,716 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;@31a8fd28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:01:54,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-19 07:01:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 51 states have (on average 2.019607843137255) internal successors, (103), 93 states have internal predecessors, (103), 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 07:01:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:01:54,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:54,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:01:54,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash 894013205, now seen corresponding path program 1 times [2024-11-19 07:01:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:54,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207141768] [2024-11-19 07:01:54,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:54,971 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 07:01:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:54,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207141768] [2024-11-19 07:01:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207141768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:01:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807148946] [2024-11-19 07:01:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:54,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:01:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:01:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:55,016 INFO L87 Difference]: Start difference. First operand has 97 states, 51 states have (on average 2.019607843137255) internal successors, (103), 93 states have internal predecessors, (103), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:55,141 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-19 07:01:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:01:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:01:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:55,151 INFO L225 Difference]: With dead ends: 94 [2024-11-19 07:01:55,152 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 07:01:55,154 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 07:01:55,159 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:55,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 07:01:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-19 07:01:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 87 states have internal predecessors, (91), 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 07:01:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-19 07:01:55,196 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 6 [2024-11-19 07:01:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:55,196 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-19 07:01:55,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-19 07:01:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:01:55,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:55,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:01:55,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:01:55,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:55,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash 894013206, now seen corresponding path program 1 times [2024-11-19 07:01:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:55,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686319445] [2024-11-19 07:01:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:55,346 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 07:01:55,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:55,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686319445] [2024-11-19 07:01:55,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686319445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:55,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:55,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:01:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217227908] [2024-11-19 07:01:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:55,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:01:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:01:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:55,350 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:55,430 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-19 07:01:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:01:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:01:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:55,432 INFO L225 Difference]: With dead ends: 89 [2024-11-19 07:01:55,432 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 07:01:55,432 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 07:01:55,433 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:55,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 145 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 07:01:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 07:01:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 85 states have internal predecessors, (89), 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 07:01:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-19 07:01:55,450 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 6 [2024-11-19 07:01:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:55,450 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-19 07:01:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-19 07:01:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 07:01:55,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:55,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:55,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:01:55,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:55,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 240538839, now seen corresponding path program 1 times [2024-11-19 07:01:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47183545] [2024-11-19 07:01:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:55,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:55,593 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 07:01:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47183545] [2024-11-19 07:01:55,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47183545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:55,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:55,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:01:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226131718] [2024-11-19 07:01:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:55,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:01:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:55,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:01:55,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:55,601 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 07:01:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:55,620 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-19 07:01:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:01:55,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 07:01:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:55,623 INFO L225 Difference]: With dead ends: 96 [2024-11-19 07:01:55,623 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 07:01:55,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:55,624 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:55,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 07:01:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2024-11-19 07:01:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.836734693877551) internal successors, (90), 86 states have internal predecessors, (90), 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 07:01:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-19 07:01:55,643 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 13 [2024-11-19 07:01:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-19 07:01:55,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 07:01:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-19 07:01:55,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:01:55,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:55,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:01:55,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:55,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 564137500, now seen corresponding path program 1 times [2024-11-19 07:01:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111693067] [2024-11-19 07:01:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:01:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111693067] [2024-11-19 07:01:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111693067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:55,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:55,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:01:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664151260] [2024-11-19 07:01:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:55,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:01:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:01:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:55,846 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:01:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:56,021 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-19 07:01:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:01:56,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 07:01:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:56,023 INFO L225 Difference]: With dead ends: 89 [2024-11-19 07:01:56,025 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 07:01:56,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:56,026 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:56,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 261 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:01:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 07:01:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 07:01:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 49 states have (on average 1.816326530612245) internal successors, (89), 85 states have internal predecessors, (89), 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 07:01:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-19 07:01:56,037 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 22 [2024-11-19 07:01:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:56,038 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-19 07:01:56,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:01:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-19 07:01:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:01:56,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:56,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:56,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:01:56,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:56,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash 564137501, now seen corresponding path program 1 times [2024-11-19 07:01:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860611902] [2024-11-19 07:01:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:56,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:56,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860611902] [2024-11-19 07:01:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860611902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:01:56,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713591424] [2024-11-19 07:01:56,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:56,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:01:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:56,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:01:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:56,312 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:01:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:56,463 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-19 07:01:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:01:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 07:01:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:56,465 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:01:56,465 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:01:56,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:56,467 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:56,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 285 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:01:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 07:01:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 84 states have internal predecessors, (88), 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 07:01:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-19 07:01:56,475 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 22 [2024-11-19 07:01:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:56,476 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-19 07:01:56,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:01:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-19 07:01:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:01:56,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:56,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:56,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:01:56,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:56,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash 13222085, now seen corresponding path program 1 times [2024-11-19 07:01:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243521644] [2024-11-19 07:01:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:56,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243521644] [2024-11-19 07:01:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243521644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793048966] [2024-11-19 07:01:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:56,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:56,789 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 07:01:56,790 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 07:01:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:56,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 07:01:56,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:56,962 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 07:01:57,050 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 07:01:57,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 07:01:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:57,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793048966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:57,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2024-11-19 07:01:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23469547] [2024-11-19 07:01:57,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:57,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 07:01:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:57,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 07:01:57,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-19 07:01:57,499 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:01:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:57,782 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-19 07:01:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:01:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-19 07:01:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:57,784 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:01:57,784 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:01:57,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-19 07:01:57,785 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:57,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 455 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:01:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:01:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 07:01:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 83 states have internal predecessors, (87), 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 07:01:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-19 07:01:57,790 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 25 [2024-11-19 07:01:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:57,790 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-19 07:01:57,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:01:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-19 07:01:57,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:01:57,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:57,791 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:57,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 07:01:57,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 07:01:57,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:57,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash 13222086, now seen corresponding path program 1 times [2024-11-19 07:01:57,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:57,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904856865] [2024-11-19 07:01:57,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:57,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904856865] [2024-11-19 07:01:58,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904856865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:58,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431723483] [2024-11-19 07:01:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:58,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:58,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:58,362 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 07:01:58,363 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 07:01:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:58,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 07:01:58,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:58,506 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 07:01:58,511 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 07:01:58,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:58,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:01:58,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:01:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:01:58,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431723483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:58,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:01:58,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-19 07:01:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298826286] [2024-11-19 07:01:58,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:58,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 07:01:58,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 07:01:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-19 07:01:58,944 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:01:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:59,441 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-19 07:01:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 07:01:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-19 07:01:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:59,443 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:01:59,443 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:01:59,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-19 07:01:59,444 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:59,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 630 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:01:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:01:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-19 07:01:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 82 states have internal predecessors, (86), 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 07:01:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-19 07:01:59,453 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 25 [2024-11-19 07:01:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:59,453 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-19 07:01:59,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:01:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-19 07:01:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:01:59,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:59,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:59,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 07:01:59,658 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,SelfDestructingSolverStorable6 [2024-11-19 07:01:59,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:01:59,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 281017908, now seen corresponding path program 1 times [2024-11-19 07:01:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118018807] [2024-11-19 07:01:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:01:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118018807] [2024-11-19 07:01:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118018807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618383179] [2024-11-19 07:01:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:59,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:59,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:59,800 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 07:01:59,801 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 07:01:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:59,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 07:01:59,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:01:59,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:01:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618383179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:01:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-19 07:01:59,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366490020] [2024-11-19 07:01:59,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:59,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:01:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:01:59,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:59,938 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:01:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:59,953 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2024-11-19 07:01:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:01:59,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-19 07:01:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:59,955 INFO L225 Difference]: With dead ends: 142 [2024-11-19 07:01:59,955 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 07:01:59,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:59,956 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 173 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:59,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 168 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 07:01:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2024-11-19 07:01:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.74) internal successors, (87), 83 states have internal predecessors, (87), 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 07:01:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-19 07:01:59,967 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 29 [2024-11-19 07:01:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:59,967 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-19 07:01:59,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:01:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-19 07:01:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:01:59,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:59,968 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:59,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 07:02:00,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:00,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:00,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash 281017896, now seen corresponding path program 1 times [2024-11-19 07:02:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:00,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139009538] [2024-11-19 07:02:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 07:02:00,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:00,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139009538] [2024-11-19 07:02:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139009538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270297448] [2024-11-19 07:02:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:00,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:00,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:00,471 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 07:02:00,473 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 07:02:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:00,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 07:02:00,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:00,601 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 07:02:00,613 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-19 07:02:00,655 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 07:02:00,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 07:02:00,706 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))) is different from false [2024-11-19 07:02:00,708 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))) is different from true [2024-11-19 07:02:00,721 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-19 07:02:00,723 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from true [2024-11-19 07:02:00,746 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)))) is different from false [2024-11-19 07:02:00,748 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)))) is different from true [2024-11-19 07:02:00,824 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1)))) is different from false [2024-11-19 07:02:00,827 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1) (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1)))) is different from true [2024-11-19 07:02:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-19 07:02:00,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:01,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270297448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:01,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:01,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-11-19 07:02:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898880987] [2024-11-19 07:02:01,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:01,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 07:02:01,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:01,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 07:02:01,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=219, Unknown=9, NotChecked=170, Total=462 [2024-11-19 07:02:01,057 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:01,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))))) is different from false [2024-11-19 07:02:01,163 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))))) is different from true [2024-11-19 07:02:01,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) is different from false [2024-11-19 07:02:01,168 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) is different from true [2024-11-19 07:02:01,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)))))) is different from false [2024-11-19 07:02:01,172 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)))))) is different from true [2024-11-19 07:02:01,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)))))) is different from false [2024-11-19 07:02:01,177 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1)))))) is different from true [2024-11-19 07:02:01,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1)))))) is different from false [2024-11-19 07:02:01,183 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 1)))))) is different from true [2024-11-19 07:02:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:01,501 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2024-11-19 07:02:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 07:02:01,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-19 07:02:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:01,502 INFO L225 Difference]: With dead ends: 139 [2024-11-19 07:02:01,502 INFO L226 Difference]: Without dead ends: 139 [2024-11-19 07:02:01,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=303, Unknown=19, NotChecked=450, Total=870 [2024-11-19 07:02:01,503 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 81 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 831 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:01,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 368 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 467 Invalid, 0 Unknown, 831 Unchecked, 0.3s Time] [2024-11-19 07:02:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-19 07:02:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2024-11-19 07:02:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.619047619047619) internal successors, (102), 92 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-19 07:02:01,513 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 29 [2024-11-19 07:02:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-19 07:02:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-19 07:02:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:02:01,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:01,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:01,532 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 07:02:01,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:01,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:01,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash 281017897, now seen corresponding path program 1 times [2024-11-19 07:02:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315554855] [2024-11-19 07:02:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315554855] [2024-11-19 07:02:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315554855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595397673] [2024-11-19 07:02:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:02,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:02,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:02,087 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 07:02:02,089 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 07:02:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:02,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 07:02:02,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:02,223 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 07:02:02,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 07:02:02,260 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-19 07:02:02,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:02,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:02:02,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 07:02:02,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:02,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:02:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:02,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595397673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:02,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2024-11-19 07:02:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328965493] [2024-11-19 07:02:02,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:02,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 07:02:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:02,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 07:02:02,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=246, Unknown=1, NotChecked=32, Total=342 [2024-11-19 07:02:02,567 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:02,860 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-19 07:02:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:02:02,860 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-19 07:02:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:02,861 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:02:02,861 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:02:02,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=336, Unknown=1, NotChecked=38, Total=462 [2024-11-19 07:02:02,862 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 192 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:02,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 234 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2024-11-19 07:02:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:02:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 07:02:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-19 07:02:02,866 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2024-11-19 07:02:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:02,867 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-19 07:02:02,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-19 07:02:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:02:02,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:02,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:02,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 07:02:03,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 07:02:03,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:03,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash 121620195, now seen corresponding path program 1 times [2024-11-19 07:02:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678167123] [2024-11-19 07:02:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:03,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678167123] [2024-11-19 07:02:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678167123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:03,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:03,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411963279] [2024-11-19 07:02:03,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:03,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:03,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:03,298 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:03,574 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2024-11-19 07:02:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 07:02:03,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 07:02:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:03,576 INFO L225 Difference]: With dead ends: 121 [2024-11-19 07:02:03,576 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 07:02:03,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:02:03,577 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:03,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 332 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 07:02:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2024-11-19 07:02:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.421875) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-19 07:02:03,586 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2024-11-19 07:02:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:03,586 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-19 07:02:03,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-19 07:02:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:02:03,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:03,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:03,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:02:03,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:03,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash 121620196, now seen corresponding path program 1 times [2024-11-19 07:02:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:03,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320947950] [2024-11-19 07:02:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320947950] [2024-11-19 07:02:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320947950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:03,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064227591] [2024-11-19 07:02:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:03,933 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:04,155 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2024-11-19 07:02:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 07:02:04,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 07:02:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:04,157 INFO L225 Difference]: With dead ends: 124 [2024-11-19 07:02:04,157 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 07:02:04,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:02:04,157 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 75 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:04,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 410 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 07:02:04,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2024-11-19 07:02:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.390625) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-19 07:02:04,161 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 30 [2024-11-19 07:02:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:04,162 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-19 07:02:04,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-19 07:02:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:02:04,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:04,163 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 07:02:04,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:02:04,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:04,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash 912890852, now seen corresponding path program 1 times [2024-11-19 07:02:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467416920] [2024-11-19 07:02:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467416920] [2024-11-19 07:02:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467416920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:04,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:02:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088898810] [2024-11-19 07:02:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:04,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:02:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:04,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:02:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:04,215 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:04,280 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-11-19 07:02:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:02:04,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-19 07:02:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:04,281 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:02:04,282 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:02:04,282 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 07:02:04,282 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 32 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:04,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 78 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:02:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2024-11-19 07:02:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 71 states have internal predecessors, (75), 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 07:02:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-19 07:02:04,286 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 32 [2024-11-19 07:02:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:04,286 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-19 07:02:04,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-19 07:02:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 07:02:04,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:04,287 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 07:02:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:02:04,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 198473554, now seen corresponding path program 1 times [2024-11-19 07:02:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084043890] [2024-11-19 07:02:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084043890] [2024-11-19 07:02:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084043890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877564096] [2024-11-19 07:02:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:04,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:04,458 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:04,645 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-19 07:02:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 07:02:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-19 07:02:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:04,646 INFO L225 Difference]: With dead ends: 120 [2024-11-19 07:02:04,646 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 07:02:04,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 07:02:04,647 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 75 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:04,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 517 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 07:02:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2024-11-19 07:02:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.484375) internal successors, (95), 83 states have internal predecessors, (95), 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 07:02:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-11-19 07:02:04,651 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 35 [2024-11-19 07:02:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:04,651 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-19 07:02:04,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-11-19 07:02:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:02:04,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:04,652 INFO L215 NwaCegarLoop]: trace histogram [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 07:02:04,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:02:04,652 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:04,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1858143914, now seen corresponding path program 1 times [2024-11-19 07:02:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:04,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443789356] [2024-11-19 07:02:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443789356] [2024-11-19 07:02:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443789356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:04,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:02:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008304371] [2024-11-19 07:02:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:04,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:04,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:04,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:04,748 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:04,858 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-19 07:02:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:04,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-19 07:02:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:04,859 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:02:04,859 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:02:04,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:02:04,860 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:04,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 178 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:02:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 07:02:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 82 states have internal predecessors, (95), 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 07:02:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-19 07:02:04,863 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 36 [2024-11-19 07:02:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:04,863 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-19 07:02:04,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-19 07:02:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:02:04,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:04,864 INFO L215 NwaCegarLoop]: trace histogram [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 07:02:04,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 07:02:04,865 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:04,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1858143915, now seen corresponding path program 1 times [2024-11-19 07:02:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294964787] [2024-11-19 07:02:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294964787] [2024-11-19 07:02:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294964787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 07:02:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796820871] [2024-11-19 07:02:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:05,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 07:02:05,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:05,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 07:02:05,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 07:02:05,296 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:05,620 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2024-11-19 07:02:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 07:02:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-19 07:02:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:05,622 INFO L225 Difference]: With dead ends: 124 [2024-11-19 07:02:05,622 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 07:02:05,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-19 07:02:05,623 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 83 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:05,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 472 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:02:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 07:02:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2024-11-19 07:02:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 92 states have internal predecessors, (107), 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 07:02:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-19 07:02:05,627 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 36 [2024-11-19 07:02:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:05,627 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-19 07:02:05,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-19 07:02:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:02:05,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:05,628 INFO L215 NwaCegarLoop]: trace histogram [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 07:02:05,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:02:05,628 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:05,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:05,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1857712965, now seen corresponding path program 1 times [2024-11-19 07:02:05,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930414552] [2024-11-19 07:02:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930414552] [2024-11-19 07:02:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930414552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:05,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:05,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935537783] [2024-11-19 07:02:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:05,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:05,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:05,876 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:06,131 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2024-11-19 07:02:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 07:02:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-19 07:02:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:06,133 INFO L225 Difference]: With dead ends: 125 [2024-11-19 07:02:06,133 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 07:02:06,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 07:02:06,134 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:06,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 418 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 07:02:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2024-11-19 07:02:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 95 states have internal predecessors, (110), 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 07:02:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-19 07:02:06,138 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 36 [2024-11-19 07:02:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:06,138 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-19 07:02:06,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-19 07:02:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 07:02:06,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:06,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:06,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 07:02:06,140 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1754527156, now seen corresponding path program 1 times [2024-11-19 07:02:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462072572] [2024-11-19 07:02:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462072572] [2024-11-19 07:02:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462072572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:02:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096212377] [2024-11-19 07:02:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:02:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:06,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:02:06,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:06,221 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:06,294 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-11-19 07:02:06,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:02:06,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-19 07:02:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:06,296 INFO L225 Difference]: With dead ends: 98 [2024-11-19 07:02:06,296 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 07:02:06,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:06,297 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:06,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 152 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 07:02:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 07:02:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 94 states have internal predecessors, (108), 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 07:02:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-11-19 07:02:06,302 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 37 [2024-11-19 07:02:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:06,303 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-19 07:02:06,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-11-19 07:02:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 07:02:06,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:06,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:06,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:02:06,305 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:06,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1444232920, now seen corresponding path program 1 times [2024-11-19 07:02:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602793067] [2024-11-19 07:02:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:06,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602793067] [2024-11-19 07:02:06,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602793067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:06,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122417341] [2024-11-19 07:02:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:06,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:06,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:06,547 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:06,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 07:02:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:06,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 07:02:06,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:06,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:06,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:02:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:06,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:02:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122417341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:06,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:02:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-11-19 07:02:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145708870] [2024-11-19 07:02:06,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:06,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:02:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:02:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-19 07:02:06,813 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:06,938 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-11-19 07:02:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-19 07:02:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:06,939 INFO L225 Difference]: With dead ends: 97 [2024-11-19 07:02:06,939 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 07:02:06,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-19 07:02:06,940 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:06,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 137 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 07:02:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 07:02:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.358974358974359) internal successors, (106), 93 states have internal predecessors, (106), 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 07:02:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-19 07:02:06,943 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 38 [2024-11-19 07:02:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-19 07:02:06,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-19 07:02:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:02:06,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:06,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:06,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 07:02:07,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:07,146 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:07,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 61532336, now seen corresponding path program 1 times [2024-11-19 07:02:07,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:07,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166769910] [2024-11-19 07:02:07,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:07,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:07,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166769910] [2024-11-19 07:02:07,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166769910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:07,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:07,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764407235] [2024-11-19 07:02:07,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:07,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:07,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:07,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:07,325 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:07,498 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2024-11-19 07:02:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 07:02:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-19 07:02:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:07,500 INFO L225 Difference]: With dead ends: 126 [2024-11-19 07:02:07,500 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 07:02:07,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 07:02:07,501 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 60 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:07,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 486 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 07:02:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2024-11-19 07:02:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 104 states have internal predecessors, (123), 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 07:02:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2024-11-19 07:02:07,504 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 41 [2024-11-19 07:02:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:07,505 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2024-11-19 07:02:07,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2024-11-19 07:02:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:02:07,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:07,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 07:02:07,506 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:07,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 61584951, now seen corresponding path program 1 times [2024-11-19 07:02:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830607936] [2024-11-19 07:02:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:08,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830607936] [2024-11-19 07:02:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830607936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837621670] [2024-11-19 07:02:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:08,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:08,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:08,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:08,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 07:02:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:08,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-19 07:02:08,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:08,293 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 07:02:08,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:08,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:08,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:08,627 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:08,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:02:08,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-19 07:02:08,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:08,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:08,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-19 07:02:08,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-19 07:02:08,990 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-19 07:02:08,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 07:02:09,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1065 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1065) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-19 07:02:09,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:09,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 07:02:09,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-19 07:02:09,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 07:02:09,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837621670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:09,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:09,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2024-11-19 07:02:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202168836] [2024-11-19 07:02:09,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:09,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 07:02:09,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 07:02:09,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1368, Unknown=13, NotChecked=74, Total=1560 [2024-11-19 07:02:09,134 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 37 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 32 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 07:02:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:09,927 INFO L93 Difference]: Finished difference Result 146 states and 172 transitions. [2024-11-19 07:02:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 07:02:09,928 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 32 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2024-11-19 07:02:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:09,929 INFO L225 Difference]: With dead ends: 146 [2024-11-19 07:02:09,929 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 07:02:09,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=2155, Unknown=13, NotChecked=94, Total=2450 [2024-11-19 07:02:09,930 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 176 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:09,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 795 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:02:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 07:02:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2024-11-19 07:02:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 124 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2024-11-19 07:02:09,936 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 41 [2024-11-19 07:02:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2024-11-19 07:02:09,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 32 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 07:02:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2024-11-19 07:02:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:02:09,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:09,938 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:09,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:10,139 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 61584952, now seen corresponding path program 1 times [2024-11-19 07:02:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14761245] [2024-11-19 07:02:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:10,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14761245] [2024-11-19 07:02:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14761245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456981426] [2024-11-19 07:02:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:10,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:10,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:11,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:11,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 07:02:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:11,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-19 07:02:11,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:11,228 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 07:02:11,461 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:11,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:11,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:11,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:11,717 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:11,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 07:02:11,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 07:02:11,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2024-11-19 07:02:12,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:12,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 07:02:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:12,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:12,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2024-11-19 07:02:12,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-11-19 07:02:12,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:12,720 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 40 treesize of output 44 [2024-11-19 07:02:12,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:12,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-19 07:02:12,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2024-11-19 07:02:12,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 07:02:12,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:12,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 07:02:12,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:12,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 07:02:12,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:12,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 07:02:12,953 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:12,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 07:02:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456981426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:13,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2024-11-19 07:02:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912313567] [2024-11-19 07:02:13,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:13,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-19 07:02:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-19 07:02:13,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3368, Unknown=1, NotChecked=0, Total=3540 [2024-11-19 07:02:13,201 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 45 states, 43 states have (on average 1.697674418604651) internal successors, (73), 39 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 07:02:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:14,820 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2024-11-19 07:02:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 07:02:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.697674418604651) internal successors, (73), 39 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2024-11-19 07:02:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:14,822 INFO L225 Difference]: With dead ends: 151 [2024-11-19 07:02:14,822 INFO L226 Difference]: Without dead ends: 151 [2024-11-19 07:02:14,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=353, Invalid=5652, Unknown=1, NotChecked=0, Total=6006 [2024-11-19 07:02:14,824 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 230 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:14,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1268 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 07:02:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-19 07:02:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 129. [2024-11-19 07:02:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 124 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2024-11-19 07:02:14,828 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 41 [2024-11-19 07:02:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:14,828 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2024-11-19 07:02:14,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.697674418604651) internal successors, (73), 39 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 07:02:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2024-11-19 07:02:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:02:14,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:14,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:14,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:15,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 07:02:15,030 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:15,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:15,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1839526803, now seen corresponding path program 1 times [2024-11-19 07:02:15,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:15,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513894539] [2024-11-19 07:02:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:15,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:15,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513894539] [2024-11-19 07:02:15,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513894539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:15,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:15,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:02:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959700079] [2024-11-19 07:02:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:15,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:02:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:02:15,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:02:15,117 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:15,170 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2024-11-19 07:02:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:02:15,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-19 07:02:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:15,171 INFO L225 Difference]: With dead ends: 127 [2024-11-19 07:02:15,171 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 07:02:15,171 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 07:02:15,172 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:15,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 85 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 07:02:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 07:02:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.311926605504587) internal successors, (143), 122 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2024-11-19 07:02:15,175 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 41 [2024-11-19 07:02:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:15,175 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2024-11-19 07:02:15,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2024-11-19 07:02:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 07:02:15,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:15,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:15,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 07:02:15,177 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1907502546, now seen corresponding path program 1 times [2024-11-19 07:02:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136074089] [2024-11-19 07:02:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:15,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136074089] [2024-11-19 07:02:15,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136074089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:15,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 07:02:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713091723] [2024-11-19 07:02:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:15,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:15,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:15,453 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:15,698 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2024-11-19 07:02:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 07:02:15,699 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-19 07:02:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:15,699 INFO L225 Difference]: With dead ends: 137 [2024-11-19 07:02:15,699 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 07:02:15,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-19 07:02:15,700 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 51 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:15,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 378 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 07:02:15,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-19 07:02:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 129 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2024-11-19 07:02:15,704 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 42 [2024-11-19 07:02:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:15,704 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2024-11-19 07:02:15,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2024-11-19 07:02:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 07:02:15,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:15,705 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, 1, 1] [2024-11-19 07:02:15,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 07:02:15,705 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:15,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1190755684, now seen corresponding path program 1 times [2024-11-19 07:02:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463684460] [2024-11-19 07:02:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463684460] [2024-11-19 07:02:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463684460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940019362] [2024-11-19 07:02:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:16,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:16,908 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 07:02:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:17,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-19 07:02:17,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:17,082 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 07:02:17,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:17,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:17,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:17,490 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 07:02:17,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-11-19 07:02:17,696 INFO L349 Elim1Store]: treesize reduction 45, result has 21.1 percent of original size [2024-11-19 07:02:17,696 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 34 [2024-11-19 07:02:17,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 07:02:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:17,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:18,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 07:02:18,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:18,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-11-19 07:02:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940019362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:18,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 70 [2024-11-19 07:02:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214250806] [2024-11-19 07:02:18,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-19 07:02:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:18,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-19 07:02:18,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4606, Unknown=0, NotChecked=0, Total=4830 [2024-11-19 07:02:18,953 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 70 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 62 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:02:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:20,590 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2024-11-19 07:02:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 07:02:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 62 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-11-19 07:02:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:20,592 INFO L225 Difference]: With dead ends: 155 [2024-11-19 07:02:20,592 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 07:02:20,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=445, Invalid=7565, Unknown=0, NotChecked=0, Total=8010 [2024-11-19 07:02:20,594 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 217 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:20,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1324 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 07:02:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 07:02:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2024-11-19 07:02:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 129 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2024-11-19 07:02:20,599 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 42 [2024-11-19 07:02:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2024-11-19 07:02:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 62 states have internal predecessors, (104), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:02:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2024-11-19 07:02:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 07:02:20,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:20,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:20,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:20,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 07:02:20,805 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:20,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:20,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2119059766, now seen corresponding path program 2 times [2024-11-19 07:02:20,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:20,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51918935] [2024-11-19 07:02:20,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:20,840 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:20,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:21,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:21,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51918935] [2024-11-19 07:02:21,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51918935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:21,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914227540] [2024-11-19 07:02:21,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:21,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:21,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:21,644 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:21,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 07:02:21,812 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:21,812 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:21,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-19 07:02:21,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:22,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:22,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:22,158 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 07:02:22,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2024-11-19 07:02:22,174 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 07:02:22,174 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 27 treesize of output 22 [2024-11-19 07:02:22,925 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-19 07:02:22,926 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2024-11-19 07:02:23,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 07:02:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:23,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:23,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2024-11-19 07:02:23,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2024-11-19 07:02:24,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 282 [2024-11-19 07:02:24,291 INFO L349 Elim1Store]: treesize reduction 198, result has 43.3 percent of original size [2024-11-19 07:02:24,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 1494 treesize of output 1480 [2024-11-19 07:02:27,610 INFO L349 Elim1Store]: treesize reduction 138, result has 0.7 percent of original size [2024-11-19 07:02:27,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 736 treesize of output 1 [2024-11-19 07:02:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:28,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914227540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:28,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:28,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 21] total 66 [2024-11-19 07:02:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019444779] [2024-11-19 07:02:28,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:28,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-19 07:02:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-19 07:02:28,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4086, Unknown=0, NotChecked=0, Total=4290 [2024-11-19 07:02:28,019 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 66 states, 65 states have (on average 1.7230769230769232) internal successors, (112), 60 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:02:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:30,292 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2024-11-19 07:02:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 07:02:30,292 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.7230769230769232) internal successors, (112), 60 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-19 07:02:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:30,293 INFO L225 Difference]: With dead ends: 135 [2024-11-19 07:02:30,293 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 07:02:30,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=485, Invalid=7347, Unknown=0, NotChecked=0, Total=7832 [2024-11-19 07:02:30,295 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 114 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:30,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1504 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 07:02:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 07:02:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-19 07:02:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 129 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2024-11-19 07:02:30,299 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 46 [2024-11-19 07:02:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:30,300 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2024-11-19 07:02:30,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.7230769230769232) internal successors, (112), 60 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:02:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2024-11-19 07:02:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 07:02:30,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:30,301 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:30,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:30,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 07:02:30,502 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1267974241, now seen corresponding path program 1 times [2024-11-19 07:02:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019019102] [2024-11-19 07:02:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 07:02:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019019102] [2024-11-19 07:02:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019019102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:30,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11219413] [2024-11-19 07:02:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:30,729 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:30,970 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2024-11-19 07:02:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 07:02:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-19 07:02:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:30,971 INFO L225 Difference]: With dead ends: 153 [2024-11-19 07:02:30,971 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 07:02:30,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 07:02:30,972 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 47 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:30,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 463 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 07:02:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2024-11-19 07:02:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.288) internal successors, (161), 138 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2024-11-19 07:02:30,980 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 47 [2024-11-19 07:02:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:30,981 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2024-11-19 07:02:30,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2024-11-19 07:02:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 07:02:30,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:30,982 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:30,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 07:02:30,982 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -652495675, now seen corresponding path program 1 times [2024-11-19 07:02:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:30,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802528485] [2024-11-19 07:02:30,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:02:31,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802528485] [2024-11-19 07:02:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802528485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:02:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557225137] [2024-11-19 07:02:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:31,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:02:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:02:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:31,072 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:31,145 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2024-11-19 07:02:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:02:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-19 07:02:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:31,146 INFO L225 Difference]: With dead ends: 142 [2024-11-19 07:02:31,146 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 07:02:31,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:31,147 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:31,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 148 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 07:02:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-19 07:02:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 125 states have (on average 1.28) internal successors, (160), 137 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2024-11-19 07:02:31,151 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 48 [2024-11-19 07:02:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:31,151 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-19 07:02:31,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2024-11-19 07:02:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 07:02:31,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:31,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:31,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:02:31,152 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:31,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1247470690, now seen corresponding path program 1 times [2024-11-19 07:02:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360697810] [2024-11-19 07:02:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 07:02:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360697810] [2024-11-19 07:02:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360697810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870765733] [2024-11-19 07:02:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:31,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:31,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:31,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:31,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 07:02:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:31,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 07:02:31,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:31,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:31,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:02:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:02:31,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:02:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870765733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:31,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:02:31,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-11-19 07:02:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505927540] [2024-11-19 07:02:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:31,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:02:31,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:31,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:02:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-19 07:02:31,692 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:31,762 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2024-11-19 07:02:31,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:31,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-19 07:02:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:31,764 INFO L225 Difference]: With dead ends: 141 [2024-11-19 07:02:31,764 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 07:02:31,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-19 07:02:31,764 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 90 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:31,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 103 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 07:02:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-19 07:02:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 125 states have (on average 1.272) internal successors, (159), 136 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:02:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2024-11-19 07:02:31,768 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 49 [2024-11-19 07:02:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:31,769 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2024-11-19 07:02:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2024-11-19 07:02:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 07:02:31,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:31,770 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-11-19 07:02:31,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:31,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 07:02:31,971 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:31,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1751585061, now seen corresponding path program 3 times [2024-11-19 07:02:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771209673] [2024-11-19 07:02:31,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 07:02:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:31,995 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 07:02:31,995 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 07:02:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:32,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771209673] [2024-11-19 07:02:32,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771209673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600519369] [2024-11-19 07:02:32,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 07:02:32,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:32,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:32,059 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:32,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 07:02:32,252 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 07:02:32,253 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:32,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:02:32,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:32,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:02:32,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600519369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:32,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:02:32,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-19 07:02:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927627872] [2024-11-19 07:02:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:32,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:02:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:32,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:02:32,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:32,275 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:32,284 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-19 07:02:32,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:02:32,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2024-11-19 07:02:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:32,285 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:02:32,285 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:02:32,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:32,285 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:32,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:02:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 07:02:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 83 states have internal predecessors, (87), 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 07:02:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-19 07:02:32,288 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2024-11-19 07:02:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:32,288 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-19 07:02:32,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-19 07:02:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 07:02:32,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:32,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:32,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 07:02:32,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:32,489 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash -631172250, now seen corresponding path program 1 times [2024-11-19 07:02:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:32,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966949819] [2024-11-19 07:02:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966949819] [2024-11-19 07:02:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966949819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521084779] [2024-11-19 07:02:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:34,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:34,004 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:34,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 07:02:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:34,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-19 07:02:34,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:34,211 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 07:02:34,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:34,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:34,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:34,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:34,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:02:35,020 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-19 07:02:35,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2024-11-19 07:02:35,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-11-19 07:02:35,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:35,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2024-11-19 07:02:35,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-19 07:02:35,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 07:02:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:35,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:36,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 07:02:36,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-11-19 07:02:36,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:36,175 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 31 treesize of output 35 [2024-11-19 07:02:36,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-19 07:02:36,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-19 07:02:36,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521084779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:36,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:36,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29] total 56 [2024-11-19 07:02:36,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448392716] [2024-11-19 07:02:36,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:36,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-19 07:02:36,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:36,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-19 07:02:36,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3953, Unknown=0, NotChecked=0, Total=4160 [2024-11-19 07:02:36,378 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 57 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 52 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:38,301 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2024-11-19 07:02:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 07:02:38,302 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 52 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-19 07:02:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:38,303 INFO L225 Difference]: With dead ends: 126 [2024-11-19 07:02:38,303 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 07:02:38,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=497, Invalid=7693, Unknown=0, NotChecked=0, Total=8190 [2024-11-19 07:02:38,305 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 154 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:38,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1146 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 07:02:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 07:02:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 94. [2024-11-19 07:02:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 90 states have internal predecessors, (96), 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 07:02:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-11-19 07:02:38,308 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 54 [2024-11-19 07:02:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:38,308 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-11-19 07:02:38,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 52 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-11-19 07:02:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 07:02:38,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:38,309 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:38,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 07:02:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-19 07:02:38,511 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash -631172249, now seen corresponding path program 1 times [2024-11-19 07:02:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680458444] [2024-11-19 07:02:38,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680458444] [2024-11-19 07:02:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680458444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355651878] [2024-11-19 07:02:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:39,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:39,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:39,065 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:39,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 07:02:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:39,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-19 07:02:39,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:39,286 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 07:02:39,289 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 07:02:39,456 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 07:02:39,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 07:02:39,465 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:39,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:39,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:39,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:39,616 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:39,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 07:02:39,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 07:02:39,807 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:39,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:39,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2024-11-19 07:02:40,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:40,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:40,240 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 34 treesize of output 58 [2024-11-19 07:02:40,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 07:02:40,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-19 07:02:40,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 07:02:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:40,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:41,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 129 [2024-11-19 07:02:41,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-19 07:02:41,781 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1998 (Array Int Int)) (|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1998))) (or (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0) 1)) (not (= (select (select .cse0 |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) 0))))) (forall ((v_ArrVal_1998 (Array Int Int)) (|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1998))) (or (forall ((v_ArrVal_1999 (Array Int Int))) (<= (+ (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1999) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0)))) (not (= (select (select .cse1 |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) 0)))))) is different from false [2024-11-19 07:02:41,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-11-19 07:02:41,811 INFO L349 Elim1Store]: treesize reduction 4, result has 87.1 percent of original size [2024-11-19 07:02:41,812 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 58 treesize of output 72 [2024-11-19 07:02:41,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,826 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 30 treesize of output 34 [2024-11-19 07:02:41,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-19 07:02:41,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2024-11-19 07:02:41,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:41,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 07:02:41,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:41,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 07:02:41,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-19 07:02:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355651878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:42,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:42,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27] total 40 [2024-11-19 07:02:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663842336] [2024-11-19 07:02:42,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:42,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-19 07:02:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-19 07:02:42,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2952, Unknown=34, NotChecked=110, Total=3306 [2024-11-19 07:02:42,129 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 41 states, 40 states have (on average 2.3) internal successors, (92), 38 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:45,220 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2024-11-19 07:02:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-19 07:02:45,221 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.3) internal successors, (92), 38 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-19 07:02:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:45,221 INFO L225 Difference]: With dead ends: 153 [2024-11-19 07:02:45,221 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 07:02:45,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=727, Invalid=7419, Unknown=48, NotChecked=178, Total=8372 [2024-11-19 07:02:45,224 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 433 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:45,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 807 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 07:02:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 07:02:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 105. [2024-11-19 07:02:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 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 07:02:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-11-19 07:02:45,228 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 54 [2024-11-19 07:02:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:45,228 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-11-19 07:02:45,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.3) internal successors, (92), 38 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-11-19 07:02:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 07:02:45,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:45,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:45,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 07:02:45,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:45,430 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:45,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1908510781, now seen corresponding path program 1 times [2024-11-19 07:02:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:45,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840259701] [2024-11-19 07:02:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:02:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840259701] [2024-11-19 07:02:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840259701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991826071] [2024-11-19 07:02:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:45,553 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:45,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 07:02:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:45,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 07:02:45,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:02:45,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:02:45,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991826071] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:45,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:45,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-19 07:02:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472739261] [2024-11-19 07:02:45,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:45,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:02:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:45,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:02:45,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:02:45,905 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:45,934 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2024-11-19 07:02:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:02:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-19 07:02:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:45,935 INFO L225 Difference]: With dead ends: 147 [2024-11-19 07:02:45,935 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 07:02:45,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:45,935 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 180 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:45,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 268 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 07:02:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2024-11-19 07:02:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 101 states have internal predecessors, (111), 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 07:02:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2024-11-19 07:02:45,939 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 55 [2024-11-19 07:02:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:45,939 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2024-11-19 07:02:45,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2024-11-19 07:02:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 07:02:45,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:45,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:45,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-19 07:02:46,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:46,141 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1792179025, now seen corresponding path program 1 times [2024-11-19 07:02:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:46,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861137240] [2024-11-19 07:02:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861137240] [2024-11-19 07:02:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861137240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759741046] [2024-11-19 07:02:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:46,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:46,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:46,956 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:46,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 07:02:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:47,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-19 07:02:47,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:47,166 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 07:02:47,290 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:47,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:47,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:02:47,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:02:47,546 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-19 07:02:47,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 07:02:47,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-19 07:02:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:47,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:48,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:48,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-11-19 07:02:48,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-19 07:02:48,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:48,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 07:02:48,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:48,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2024-11-19 07:02:48,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759741046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:48,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:48,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 46 [2024-11-19 07:02:48,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329227485] [2024-11-19 07:02:48,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:48,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-19 07:02:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-19 07:02:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2882, Unknown=25, NotChecked=0, Total=3080 [2024-11-19 07:02:48,575 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 47 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 42 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:49,411 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2024-11-19 07:02:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 07:02:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 42 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2024-11-19 07:02:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:49,412 INFO L225 Difference]: With dead ends: 150 [2024-11-19 07:02:49,412 INFO L226 Difference]: Without dead ends: 150 [2024-11-19 07:02:49,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=272, Invalid=4125, Unknown=25, NotChecked=0, Total=4422 [2024-11-19 07:02:49,413 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 128 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:49,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1191 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:02:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-19 07:02:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 117. [2024-11-19 07:02:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 113 states have internal predecessors, (128), 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 07:02:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2024-11-19 07:02:49,416 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 59 [2024-11-19 07:02:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:49,417 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2024-11-19 07:02:49,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 42 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2024-11-19 07:02:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 07:02:49,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:49,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:49,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:49,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-19 07:02:49,618 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:49,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash 277456110, now seen corresponding path program 1 times [2024-11-19 07:02:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:49,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582878245] [2024-11-19 07:02:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:50,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582878245] [2024-11-19 07:02:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582878245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415996712] [2024-11-19 07:02:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:50,366 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:50,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 07:02:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:50,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-19 07:02:50,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:50,627 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 07:02:50,790 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:50,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:50,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:02:50,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:02:51,503 INFO L349 Elim1Store]: treesize reduction 73, result has 17.0 percent of original size [2024-11-19 07:02:51,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 64 [2024-11-19 07:02:51,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:51,534 INFO L349 Elim1Store]: treesize reduction 96, result has 22.0 percent of original size [2024-11-19 07:02:51,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 50 [2024-11-19 07:02:51,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-11-19 07:02:51,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 07:02:52,029 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 07:02:52,029 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 10 [2024-11-19 07:02:52,037 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-19 07:02:52,037 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 20 [2024-11-19 07:02:52,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 07:02:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:52,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:53,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:53,011 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 209 [2024-11-19 07:02:53,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:53,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 87 [2024-11-19 07:02:53,565 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-19 07:02:53,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 301 treesize of output 277 [2024-11-19 07:02:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415996712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:53,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 33, 19] total 58 [2024-11-19 07:02:53,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192568605] [2024-11-19 07:02:53,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:53,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-19 07:02:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-19 07:02:53,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3065, Unknown=0, NotChecked=0, Total=3306 [2024-11-19 07:02:53,664 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 55 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:55,440 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2024-11-19 07:02:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-19 07:02:55,440 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 55 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-19 07:02:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:55,441 INFO L225 Difference]: With dead ends: 150 [2024-11-19 07:02:55,441 INFO L226 Difference]: Without dead ends: 150 [2024-11-19 07:02:55,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=462, Invalid=5088, Unknown=0, NotChecked=0, Total=5550 [2024-11-19 07:02:55,442 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 131 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:55,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1140 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 07:02:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-19 07:02:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2024-11-19 07:02:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 129 states have internal predecessors, (148), 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 07:02:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2024-11-19 07:02:55,447 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 60 [2024-11-19 07:02:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:55,447 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2024-11-19 07:02:55,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 55 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2024-11-19 07:02:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 07:02:55,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:55,448 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:55,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:55,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:55,648 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:02:55,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash 277025160, now seen corresponding path program 1 times [2024-11-19 07:02:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934625214] [2024-11-19 07:02:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934625214] [2024-11-19 07:02:56,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934625214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59709403] [2024-11-19 07:02:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:56,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:56,542 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:56,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 07:02:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:56,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-19 07:02:56,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:56,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:02:57,085 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 07:02:57,086 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 21 treesize of output 24 [2024-11-19 07:02:57,979 INFO L349 Elim1Store]: treesize reduction 28, result has 69.9 percent of original size [2024-11-19 07:02:57,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 94 [2024-11-19 07:02:58,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-19 07:02:58,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2024-11-19 07:02:58,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 07:02:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:58,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:59,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 07:02:59,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-19 07:03:03,907 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-11-19 07:03:03,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 982 treesize of output 926 [2024-11-19 07:03:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59709403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:04,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:04,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30, 30] total 76 [2024-11-19 07:03:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180429062] [2024-11-19 07:03:04,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:04,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-11-19 07:03:04,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:04,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-11-19 07:03:04,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=5370, Unknown=0, NotChecked=0, Total=5852 [2024-11-19 07:03:04,929 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand has 77 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 70 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:03:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:06,521 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2024-11-19 07:03:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 07:03:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 70 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 60 [2024-11-19 07:03:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:06,522 INFO L225 Difference]: With dead ends: 138 [2024-11-19 07:03:06,522 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 07:03:06,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=716, Invalid=7840, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 07:03:06,524 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 102 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:06,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1016 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 07:03:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 07:03:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2024-11-19 07:03:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 121 states have (on average 1.2479338842975207) internal successors, (151), 132 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 07:03:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2024-11-19 07:03:06,530 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 60 [2024-11-19 07:03:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:06,530 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2024-11-19 07:03:06,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 70 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:03:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2024-11-19 07:03:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 07:03:06,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:06,531 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:06,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-19 07:03:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:06,732 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:03:06,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1670716775, now seen corresponding path program 1 times [2024-11-19 07:03:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27499037] [2024-11-19 07:03:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:03:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27499037] [2024-11-19 07:03:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27499037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243187805] [2024-11-19 07:03:06,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:06,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:06,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:06,882 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:06,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 07:03:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:07,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:03:07,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:07,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:03:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243187805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:03:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-19 07:03:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44092583] [2024-11-19 07:03:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:07,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:07,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:07,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:07,234 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:07,248 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2024-11-19 07:03:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:03:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2024-11-19 07:03:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:07,249 INFO L225 Difference]: With dead ends: 65 [2024-11-19 07:03:07,249 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 07:03:07,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:07,250 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:07,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 07:03:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 07:03:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 61 states have internal predecessors, (61), 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 07:03:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2024-11-19 07:03:07,252 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 66 [2024-11-19 07:03:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:07,253 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2024-11-19 07:03:07,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2024-11-19 07:03:07,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 07:03:07,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:07,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:07,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-19 07:03:07,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:07,454 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2024-11-19 07:03:07,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash 252626524, now seen corresponding path program 1 times [2024-11-19 07:03:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949846649] [2024-11-19 07:03:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 07:03:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949846649] [2024-11-19 07:03:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949846649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043464459] [2024-11-19 07:03:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:09,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:09,944 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:09,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-19 07:03:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:10,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-19 07:03:10,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:10,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 07:03:10,372 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 9 treesize of output 8 [2024-11-19 07:03:10,375 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 07:03:10,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11