./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:45:43,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:45:43,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:45:43,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:45:43,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:45:43,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:45:43,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:45:43,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:45:43,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:45:43,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:45:43,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:45:43,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:45:43,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:45:43,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:45:43,660 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:45:43,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:45:43,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:45:43,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:45:43,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:45:43,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:45:43,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:45:43,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:45:43,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:45:43,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:45:43,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:45:43,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:45:43,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:45:43,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:45:43,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:45:43,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:45:43,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:45:43,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:45:43,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:45:43,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:45:43,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:45:43,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:45:43,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:45:43,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:45:43,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:45:43,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:45:43,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:45:43,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:45:43,669 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-clean/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-clean/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 ! call(reach_error())) ) 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2024-10-11 01:45:43,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:45:43,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:45:43,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:45:43,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:45:43,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:45:43,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2024-10-11 01:45:45,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:45:45,562 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:45:45,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2024-10-11 01:45:45,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da2d060b2/dbd0ccf0836e47229f22b0a864671e6d/FLAGf74bc457f [2024-10-11 01:45:45,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da2d060b2/dbd0ccf0836e47229f22b0a864671e6d [2024-10-11 01:45:45,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:45:45,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:45:45,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:45:45,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:45:45,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:45:45,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:45,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b72761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45, skipping insertion in model container [2024-10-11 01:45:45,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:45,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:45:45,881 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2024-10-11 01:45:45,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:45:45,895 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:45:45,954 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2024-10-11 01:45:45,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:45:45,995 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:45:45,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45 WrapperNode [2024-10-11 01:45:45,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:45:45,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:45:46,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:45:46,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:45:46,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,056 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 183 [2024-10-11 01:45:46,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:45:46,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:45:46,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:45:46,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:45:46,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,136 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-10-11 01:45:46,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:45:46,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:45:46,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:45:46,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:45:46,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (1/1) ... [2024-10-11 01:45:46,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:45:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:46,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:45:46,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:45:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 01:45:46,275 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:45:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:45:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:45:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:45:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:45:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:45:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:45:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:45:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:45:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:45:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:45:46,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:45:46,383 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:45:46,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:45:46,408 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 01:45:46,614 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-10-11 01:45:46,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:45:46,641 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:45:46,641 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-11 01:45:46,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:46 BoogieIcfgContainer [2024-10-11 01:45:46,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:45:46,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:45:46,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:45:46,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:45:46,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:45:45" (1/3) ... [2024-10-11 01:45:46,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc93610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:46, skipping insertion in model container [2024-10-11 01:45:46,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:45:45" (2/3) ... [2024-10-11 01:45:46,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc93610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:45:46, skipping insertion in model container [2024-10-11 01:45:46,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:45:46" (3/3) ... [2024-10-11 01:45:46,656 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2024-10-11 01:45:46,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:45:46,674 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:45:46,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:45:46,736 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=LoopHeads, 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;@539d4df3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:45:46,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:45:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 36 states have (on average 1.75) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:45:46,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:46,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:45:46,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:46,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2003251568, now seen corresponding path program 1 times [2024-10-11 01:45:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378195618] [2024-10-11 01:45:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378195618] [2024-10-11 01:45:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378195618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:46,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:46,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:45:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437992569] [2024-10-11 01:45:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:46,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:45:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:45:46,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:45:46,932 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.75) internal successors, (63), 38 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:46,956 INFO L93 Difference]: Finished difference Result 79 states and 129 transitions. [2024-10-11 01:45:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:45:46,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:45:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:46,963 INFO L225 Difference]: With dead ends: 79 [2024-10-11 01:45:46,963 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 01:45:46,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:45:46,969 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 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-10-11 01:45:46,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:45:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 01:45:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 01:45:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2024-10-11 01:45:46,997 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 6 [2024-10-11 01:45:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:46,997 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-10-11 01:45:46,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2024-10-11 01:45:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:45:46,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:46,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:45:46,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:45:47,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:47,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2076209727, now seen corresponding path program 1 times [2024-10-11 01:45:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:47,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16121507] [2024-10-11 01:45:47,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:47,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:47,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16121507] [2024-10-11 01:45:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16121507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:47,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:45:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960453624] [2024-10-11 01:45:47,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:47,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:45:47,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:45:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:45:47,164 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:47,236 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2024-10-11 01:45:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:45:47,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:45:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:47,237 INFO L225 Difference]: With dead ends: 60 [2024-10-11 01:45:47,237 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 01:45:47,239 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-10-11 01:45:47,240 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:47,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:45:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 01:45:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 01:45:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2024-10-11 01:45:47,247 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 6 [2024-10-11 01:45:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:47,247 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-10-11 01:45:47,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2024-10-11 01:45:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:45:47,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:47,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:47,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:45:47,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:47,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1487076580, now seen corresponding path program 1 times [2024-10-11 01:45:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920579871] [2024-10-11 01:45:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:45:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:47,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920579871] [2024-10-11 01:45:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920579871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:47,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:45:47,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455149907] [2024-10-11 01:45:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:45:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:45:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:45:47,375 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:47,472 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2024-10-11 01:45:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:45:47,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 01:45:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:47,473 INFO L225 Difference]: With dead ends: 87 [2024-10-11 01:45:47,473 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 01:45:47,474 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-10-11 01:45:47,474 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:47,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 50 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:45:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 01:45:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 47. [2024-10-11 01:45:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-10-11 01:45:47,484 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2024-10-11 01:45:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:47,484 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-10-11 01:45:47,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-10-11 01:45:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:45:47,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:47,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:47,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:45:47,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:47,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash 903946543, now seen corresponding path program 1 times [2024-10-11 01:45:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:47,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307262830] [2024-10-11 01:45:47,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:47,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:47,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307262830] [2024-10-11 01:45:47,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307262830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:47,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:47,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:45:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936191630] [2024-10-11 01:45:47,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:47,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:45:47,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:45:47,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:45:47,690 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:47,794 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2024-10-11 01:45:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:45:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 01:45:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:47,796 INFO L225 Difference]: With dead ends: 108 [2024-10-11 01:45:47,797 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 01:45:47,797 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-10-11 01:45:47,798 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:47,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 76 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:45:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 01:45:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2024-10-11 01:45:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-10-11 01:45:47,807 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 26 [2024-10-11 01:45:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:47,808 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-10-11 01:45:47,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-10-11 01:45:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:45:47,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:47,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:47,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:45:47,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:47,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -20553984, now seen corresponding path program 1 times [2024-10-11 01:45:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782550464] [2024-10-11 01:45:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:45:47,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782550464] [2024-10-11 01:45:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782550464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771487294] [2024-10-11 01:45:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:47,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:47,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:47,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:47,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:45:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:48,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:45:48,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:48,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771487294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:45:48,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:45:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2024-10-11 01:45:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663412308] [2024-10-11 01:45:48,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:48,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:45:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:45:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:45:48,298 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:48,550 INFO L93 Difference]: Finished difference Result 210 states and 278 transitions. [2024-10-11 01:45:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 01:45:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 01:45:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:48,552 INFO L225 Difference]: With dead ends: 210 [2024-10-11 01:45:48,553 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 01:45:48,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2024-10-11 01:45:48,554 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 127 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:48,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 186 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:45:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 01:45:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 106. [2024-10-11 01:45:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 105 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2024-10-11 01:45:48,575 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 29 [2024-10-11 01:45:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:48,575 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2024-10-11 01:45:48,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2024-10-11 01:45:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 01:45:48,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:48,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:48,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:45:48,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:48,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:48,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -567718870, now seen corresponding path program 2 times [2024-10-11 01:45:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180865628] [2024-10-11 01:45:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 01:45:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180865628] [2024-10-11 01:45:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180865628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912174407] [2024-10-11 01:45:48,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:45:48,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:48,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:48,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:48,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:45:49,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:45:49,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:45:49,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 01:45:49,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:49,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912174407] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:45:49,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:45:49,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 11 [2024-10-11 01:45:49,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446679244] [2024-10-11 01:45:49,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 01:45:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:49,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 01:45:49,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:45:49,313 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:49,695 INFO L93 Difference]: Finished difference Result 238 states and 299 transitions. [2024-10-11 01:45:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 01:45:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 01:45:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:49,697 INFO L225 Difference]: With dead ends: 238 [2024-10-11 01:45:49,697 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 01:45:49,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-10-11 01:45:49,699 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 151 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:49,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 257 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:45:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 01:45:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2024-10-11 01:45:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.2254335260115607) internal successors, (212), 173 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 212 transitions. [2024-10-11 01:45:49,724 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 212 transitions. Word has length 40 [2024-10-11 01:45:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:49,724 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 212 transitions. [2024-10-11 01:45:49,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2024-10-11 01:45:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 01:45:49,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:49,725 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:49,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:45:49,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:49,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:49,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash 171698528, now seen corresponding path program 3 times [2024-10-11 01:45:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:49,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790813627] [2024-10-11 01:45:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 01:45:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790813627] [2024-10-11 01:45:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790813627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:45:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 01:45:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226609790] [2024-10-11 01:45:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 01:45:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 01:45:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:45:50,550 INFO L87 Difference]: Start difference. First operand 174 states and 212 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:50,731 INFO L93 Difference]: Finished difference Result 279 states and 347 transitions. [2024-10-11 01:45:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:45:50,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-11 01:45:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:50,732 INFO L225 Difference]: With dead ends: 279 [2024-10-11 01:45:50,732 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 01:45:50,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:45:50,733 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 226 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-10-11 01:45:50,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 226 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:45:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 01:45:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2024-10-11 01:45:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 215 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 269 transitions. [2024-10-11 01:45:50,766 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 269 transitions. Word has length 45 [2024-10-11 01:45:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:50,766 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 269 transitions. [2024-10-11 01:45:50,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 269 transitions. [2024-10-11 01:45:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 01:45:50,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:50,767 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:50,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:45:50,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 851139807, now seen corresponding path program 1 times [2024-10-11 01:45:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572386532] [2024-10-11 01:45:50,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:50,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 01:45:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572386532] [2024-10-11 01:45:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572386532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330887264] [2024-10-11 01:45:51,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:51,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:51,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:51,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:45:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:51,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 01:45:51,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:52,050 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-10-11 01:45:52,117 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 01:45:52,118 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-10-11 01:45:52,172 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 01:45:52,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 01:45:52,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:45:52,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-10-11 01:45:52,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-10-11 01:45:52,434 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 18 treesize of output 7 [2024-10-11 01:45:52,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-11 01:45:52,518 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 01:45:52,519 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 19 treesize of output 18 [2024-10-11 01:45:52,536 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-11 01:45:52,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-10-11 01:45:53,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:53,221 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 141 treesize of output 101 [2024-10-11 01:45:53,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:53,230 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 97 treesize of output 97 [2024-10-11 01:45:53,410 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-10-11 01:45:53,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:45:53,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 22 [2024-10-11 01:45:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 01:45:53,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:53,812 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 1046 treesize of output 986 [2024-10-11 01:45:53,959 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 1046 treesize of output 986 [2024-10-11 01:45:56,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:56,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:45:56,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:56,090 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 322 treesize of output 314 [2024-10-11 01:45:56,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:45:56,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:45:56,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:56,180 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 3201 treesize of output 2432 [2024-10-11 01:45:57,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:45:57,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:57,288 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 3201 treesize of output 2432 [2024-10-11 01:45:57,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:45:57,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:57,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3201 treesize of output 2432 [2024-10-11 01:45:59,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:59,302 INFO L349 Elim1Store]: treesize reduction 74, result has 62.4 percent of original size [2024-10-11 01:45:59,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 45257 treesize of output 41768 [2024-10-11 01:46:00,530 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:00,531 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:00,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:00,556 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 13419 treesize of output 9902 [2024-10-11 01:46:01,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:46:01,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:46:01,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:46:01,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:01,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:46:01,860 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 322 treesize of output 314 [2024-10-11 01:46:01,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:01,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:01,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3201 treesize of output 2432 [2024-10-11 01:46:02,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:03,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:03,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 13419 treesize of output 9902 [2024-10-11 01:46:04,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:46:04,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:46:04,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:04,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:04,183 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 13419 treesize of output 9902 [2024-10-11 01:46:05,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:46:05,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:05,347 INFO L349 Elim1Store]: treesize reduction 82, result has 48.8 percent of original size [2024-10-11 01:46:05,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 45257 treesize of output 41723 [2024-10-11 01:46:06,127 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:46:06,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:06,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 13419 treesize of output 9902 [2024-10-11 01:46:15,836 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:46:15,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 48 [2024-10-11 01:46:15,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:15,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 222 [2024-10-11 01:46:16,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:46:16,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 120 [2024-10-11 01:46:16,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:46:16,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 120 [2024-10-11 01:46:16,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:16,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 222 [2024-10-11 01:46:16,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:46:16,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 48 [2024-10-11 01:46:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 01:46:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330887264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:46:16,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:46:16,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-10-11 01:46:16,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927595351] [2024-10-11 01:46:16,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:46:16,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 01:46:16,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:46:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 01:46:16,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 01:46:16,585 INFO L87 Difference]: Start difference. First operand 216 states and 269 transitions. Second operand has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:46:18,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 01:46:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:46:21,658 INFO L93 Difference]: Finished difference Result 389 states and 488 transitions. [2024-10-11 01:46:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 01:46:21,659 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-11 01:46:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:46:21,660 INFO L225 Difference]: With dead ends: 389 [2024-10-11 01:46:21,660 INFO L226 Difference]: Without dead ends: 343 [2024-10-11 01:46:21,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=365, Invalid=2827, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 01:46:21,662 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 219 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:46:21,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 722 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 01:46:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-11 01:46:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 218. [2024-10-11 01:46:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.2488479262672811) internal successors, (271), 217 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:46:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 271 transitions. [2024-10-11 01:46:21,690 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 271 transitions. Word has length 46 [2024-10-11 01:46:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:46:21,691 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 271 transitions. [2024-10-11 01:46:21,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:46:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 271 transitions. [2024-10-11 01:46:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 01:46:21,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:46:21,695 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:46:21,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:46:21,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:46:21,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:46:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:46:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash 438982976, now seen corresponding path program 2 times [2024-10-11 01:46:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:46:21,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082233296] [2024-10-11 01:46:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:46:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:46:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:46:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 01:46:23,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:46:23,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082233296] [2024-10-11 01:46:23,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082233296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:46:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179943027] [2024-10-11 01:46:23,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:46:23,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:46:23,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:46:23,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:46:23,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:46:24,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:46:24,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:46:24,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-11 01:46:24,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:46:24,087 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-10-11 01:46:24,146 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 01:46:24,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 01:46:24,261 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:46:24,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 01:46:24,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-10-11 01:46:24,424 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 01:46:24,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 01:46:24,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-10-11 01:46:24,510 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-10-11 01:46:24,591 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-11 01:46:24,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 49 [2024-10-11 01:46:24,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-10-11 01:46:24,694 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-10-11 01:46:24,697 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-10-11 01:46:25,055 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 140 treesize of output 92 [2024-10-11 01:46:25,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-10-11 01:46:25,303 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-10-11 01:46:25,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 37 [2024-10-11 01:46:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 01:46:25,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:46:25,606 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 436 treesize of output 404 [2024-10-11 01:46:25,610 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 540 treesize of output 476 [2024-10-11 01:46:29,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse4 (= |c_ULTIMATE.start_main_~#head~1#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse0 (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#head~1#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0)))) (and (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse1 (select (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (not .cse0) (and (= .cse1 0) (= .cse2 0)) (not (= (select (select .cse3 .cse2) .cse1) 0)) (not .cse4))) (or (and .cse4 .cse0) (let ((.cse6 (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse28 (+ 4 v_arrayElimCell_92))) (let ((.cse25 (select (select .cse3 v_arrayElimCell_91) .cse28)) (.cse26 (select (select .cse5 v_arrayElimCell_91) .cse28))) (let ((.cse27 (select (select .cse5 .cse25) .cse26))) (or (not (= (select (select .cse3 (select (select .cse3 .cse25) .cse26)) .cse27) 0)) (= .cse27 0))))))) (.cse7 (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse24 (+ 4 v_arrayElimCell_92))) (let ((.cse22 (select (select .cse3 v_arrayElimCell_91) .cse24)) (.cse23 (select (select .cse5 v_arrayElimCell_91) .cse24))) (let ((.cse21 (select (select .cse3 .cse22) .cse23))) (or (not (= (select (select .cse3 .cse21) (select (select .cse5 .cse22) .cse23)) 0)) (= .cse21 0)))))))) (and (or .cse6 .cse0) (or .cse6 .cse4) (or .cse7 .cse4) (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse13 (select .cse5 v_arrayElimCell_91)) (.cse11 (select .cse3 v_arrayElimCell_91)) (.cse14 (+ 4 v_arrayElimCell_92))) (let ((.cse8 (select .cse11 .cse14)) (.cse9 (select .cse13 .cse14))) (let ((.cse10 (select (select .cse5 .cse8) .cse9))) (or (not (= (select (select .cse3 (select (select .cse3 .cse8) .cse9)) .cse10) 0)) (= (select (select .cse5 (select .cse11 .cse12)) (select .cse13 .cse12)) 0) (= .cse10 0)))))) (or .cse7 .cse0) (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse19 (select .cse5 v_arrayElimCell_91)) (.cse18 (select .cse3 v_arrayElimCell_91)) (.cse20 (+ 4 v_arrayElimCell_92))) (let ((.cse16 (select .cse18 .cse20)) (.cse17 (select .cse19 .cse20))) (let ((.cse15 (select (select .cse3 .cse16) .cse17))) (or (not (= (select (select .cse3 .cse15) (select (select .cse5 .cse16) .cse17)) 0)) (= .cse15 0) (= (select (select .cse3 (select .cse18 .cse12)) (select .cse19 .cse12)) 0)))))))))))) is different from false [2024-10-11 01:46:30,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:30,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 239094 treesize of output 225706