./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-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 23:46:33,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 23:46:34,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 23:46:34,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 23:46:34,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 23:46:34,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 23:46:34,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 23:46:34,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 23:46:34,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 23:46:34,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 23:46:34,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 23:46:34,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 23:46:34,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 23:46:34,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 23:46:34,067 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 23:46:34,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 23:46:34,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 23:46:34,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 23:46:34,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 23:46:34,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 23:46:34,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 23:46:34,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 23:46:34,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 23:46:34,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 23:46:34,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 23:46:34,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 23:46:34,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 23:46:34,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 23:46:34,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 23:46:34,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 23:46:34,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 23:46:34,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 23:46:34,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:46:34,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 23:46:34,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 23:46:34,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 23:46:34,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 23:46:34,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 23:46:34,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 23:46:34,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 23:46:34,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 23:46:34,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 23:46:34,076 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-10-23 23:46:34,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 23:46:34,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 23:46:34,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 23:46:34,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 23:46:34,290 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 23:46:34,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-10-23 23:46:34,740 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 23:46:36,292 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 23:46:36,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-10-23 23:46:36,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d320166/a0b98a39df4c4d6c98a4af2867e7235d/FLAGb971cece7 [2024-10-23 23:46:36,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d320166/a0b98a39df4c4d6c98a4af2867e7235d [2024-10-23 23:46:36,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 23:46:36,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 23:46:36,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 23:46:36,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 23:46:36,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 23:46:36,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:46:36" (1/1) ... [2024-10-23 23:46:36,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43969e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:36, skipping insertion in model container [2024-10-23 23:46:36,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:46:36" (1/1) ... [2024-10-23 23:46:36,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 23:46:36,962 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-simple/sll2n_prepend_unequal.i[24165,24178] [2024-10-23 23:46:36,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:46:36,972 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 23:46:37,010 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-simple/sll2n_prepend_unequal.i[24165,24178] [2024-10-23 23:46:37,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:46:37,038 INFO L204 MainTranslator]: Completed translation [2024-10-23 23:46:37,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37 WrapperNode [2024-10-23 23:46:37,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 23:46:37,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 23:46:37,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 23:46:37,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 23:46:37,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,069 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-10-23 23:46:37,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 23:46:37,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 23:46:37,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 23:46:37,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 23:46:37,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,099 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-10-23 23:46:37,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 23:46:37,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 23:46:37,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 23:46:37,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 23:46:37,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (1/1) ... [2024-10-23 23:46:37,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:46:37,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:37,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 23:46:37,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 23:46:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 23:46:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 23:46:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-23 23:46:37,179 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-23 23:46:37,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-23 23:46:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-23 23:46:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-23 23:46:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 23:46:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-23 23:46:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-23 23:46:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-23 23:46:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 23:46:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 23:46:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-23 23:46:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 23:46:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 23:46:37,275 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 23:46:37,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 23:46:37,394 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-23 23:46:37,394 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 23:46:37,438 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 23:46:37,438 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-23 23:46:37,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:46:37 BoogieIcfgContainer [2024-10-23 23:46:37,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 23:46:37,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 23:46:37,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 23:46:37,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 23:46:37,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:46:36" (1/3) ... [2024-10-23 23:46:37,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f1b4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:46:37, skipping insertion in model container [2024-10-23 23:46:37,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:46:37" (2/3) ... [2024-10-23 23:46:37,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f1b4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:46:37, skipping insertion in model container [2024-10-23 23:46:37,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:46:37" (3/3) ... [2024-10-23 23:46:37,448 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-10-23 23:46:37,460 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 23:46:37,460 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 23:46:37,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 23:46:37,506 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;@7cf3e669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 23:46:37,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 23:46:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-23 23:46:37,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:37,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:37,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:37,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1027000244, now seen corresponding path program 1 times [2024-10-23 23:46:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:37,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783965758] [2024-10-23 23:46:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-23 23:46:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:37,733 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-23 23:46:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783965758] [2024-10-23 23:46:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783965758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:37,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 23:46:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773914959] [2024-10-23 23:46:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:37,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 23:46:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 23:46:37,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:46:37,758 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:37,798 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2024-10-23 23:46:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 23:46:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-23 23:46:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:37,805 INFO L225 Difference]: With dead ends: 38 [2024-10-23 23:46:37,806 INFO L226 Difference]: Without dead ends: 16 [2024-10-23 23:46:37,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:46:37,811 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:37,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-23 23:46:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-23 23:46:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-23 23:46:37,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2024-10-23 23:46:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:37,860 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-23 23:46:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-10-23 23:46:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-23 23:46:37,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:37,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:37,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 23:46:37,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:37,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1693233236, now seen corresponding path program 1 times [2024-10-23 23:46:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:37,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179498090] [2024-10-23 23:46:37,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-23 23:46:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:38,016 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-23 23:46:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:38,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179498090] [2024-10-23 23:46:38,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179498090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:38,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:46:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998167884] [2024-10-23 23:46:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:38,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:46:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:38,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:46:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:46:38,020 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:38,058 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-10-23 23:46:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:46:38,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-23 23:46:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:38,060 INFO L225 Difference]: With dead ends: 31 [2024-10-23 23:46:38,060 INFO L226 Difference]: Without dead ends: 19 [2024-10-23 23:46:38,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:46:38,061 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:38,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-23 23:46:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-23 23:46:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-23 23:46:38,070 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-10-23 23:46:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:38,070 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-23 23:46:38,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:46:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-23 23:46:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-23 23:46:38,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:38,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 23:46:38,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:38,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash 387079308, now seen corresponding path program 1 times [2024-10-23 23:46:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:38,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513594976] [2024-10-23 23:46:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:38,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-23 23:46:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:38,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:38,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513594976] [2024-10-23 23:46:38,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513594976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:38,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943088901] [2024-10-23 23:46:38,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:38,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:38,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:38,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 23:46:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:38,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 23:46:38,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:46:38,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943088901] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:46:38,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:46:38,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-23 23:46:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191349861] [2024-10-23 23:46:38,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:38,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 23:46:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:38,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 23:46:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:46:38,392 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:46:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:38,437 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-23 23:46:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 23:46:38,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16 [2024-10-23 23:46:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:38,439 INFO L225 Difference]: With dead ends: 32 [2024-10-23 23:46:38,439 INFO L226 Difference]: Without dead ends: 20 [2024-10-23 23:46:38,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:46:38,440 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:38,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-23 23:46:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-23 23:46:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:46:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-10-23 23:46:38,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2024-10-23 23:46:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:38,446 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-23 23:46:38,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:46:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-10-23 23:46:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-23 23:46:38,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:38,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:38,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 23:46:38,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:38,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:38,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1812742508, now seen corresponding path program 2 times [2024-10-23 23:46:38,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:38,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555957991] [2024-10-23 23:46:38,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:46:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:46:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:46:39,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:39,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555957991] [2024-10-23 23:46:39,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555957991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:46:39,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:46:39,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-23 23:46:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824875896] [2024-10-23 23:46:39,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:46:39,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-23 23:46:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:39,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-23 23:46:39,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-23 23:46:39,156 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:39,220 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-23 23:46:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-23 23:46:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-23 23:46:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:39,221 INFO L225 Difference]: With dead ends: 22 [2024-10-23 23:46:39,221 INFO L226 Difference]: Without dead ends: 20 [2024-10-23 23:46:39,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-23 23:46:39,222 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:39,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:46:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-23 23:46:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-23 23:46:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:46:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-23 23:46:39,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2024-10-23 23:46:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:39,228 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-23 23:46:39,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:46:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-23 23:46:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 23:46:39,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:39,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:39,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 23:46:39,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:39,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1711139651, now seen corresponding path program 1 times [2024-10-23 23:46:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352458920] [2024-10-23 23:46:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:46:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:46:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:46:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:46:39,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:39,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352458920] [2024-10-23 23:46:39,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352458920] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:39,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697494143] [2024-10-23 23:46:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:39,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:39,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:39,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:46:39,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 23:46:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:39,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-23 23:46:39,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:39,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-10-23 23:46:39,954 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 19 treesize of output 1 [2024-10-23 23:46:39,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-10-23 23:46:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:39,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:39,975 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 108 treesize of output 78 [2024-10-23 23:46:39,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-10-23 23:46:39,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-23 23:46:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-23 23:46:40,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697494143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:46:40,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:46:40,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 14 [2024-10-23 23:46:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373554531] [2024-10-23 23:46:40,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:40,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-23 23:46:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-23 23:46:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-23 23:46:40,033 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-23 23:46:44,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:48,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:52,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:56,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:47:00,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:47:04,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:47:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:04,251 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-10-23 23:47:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-23 23:47:04,252 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 24 [2024-10-23 23:47:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:04,253 INFO L225 Difference]: With dead ends: 27 [2024-10-23 23:47:04,253 INFO L226 Difference]: Without dead ends: 24 [2024-10-23 23:47:04,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-23 23:47:04,254 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:04,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-10-23 23:47:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-23 23:47:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-23 23:47:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:47:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-23 23:47:04,260 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 24 [2024-10-23 23:47:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:04,260 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-23 23:47:04,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-23 23:47:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-23 23:47:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 23:47:04,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:04,261 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:04,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 23:47:04,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:04,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:04,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1711137977, now seen corresponding path program 1 times [2024-10-23 23:47:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365387536] [2024-10-23 23:47:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:05,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:05,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:47:05,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:05,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365387536] [2024-10-23 23:47:05,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365387536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:05,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62538823] [2024-10-23 23:47:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:05,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:47:05,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:47:05,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 23:47:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:05,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-23 23:47:05,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:47:05,496 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-23 23:47:05,506 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-23 23:47:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-23 23:47:05,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-23 23:47:05,653 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 11 treesize of output 3 [2024-10-23 23:47:05,769 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-23 23:47:05,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-23 23:47:05,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-23 23:47:05,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-10-23 23:47:05,885 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 19 treesize of output 1 [2024-10-23 23:47:05,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-23 23:47:05,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-23 23:47:05,942 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 33 treesize of output 15 [2024-10-23 23:47:05,946 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 9 treesize of output 3 [2024-10-23 23:47:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:47:06,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:47:06,068 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 208 treesize of output 178 [2024-10-23 23:47:06,070 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 314 treesize of output 254 [2024-10-23 23:47:06,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse3 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse4 (and (forall ((v_arrayElimCell_17 Int) (v_ArrVal_618 (Array Int Int)) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_618) v_arrayElimCell_16) v_arrayElimCell_17))) (forall ((v_arrayElimCell_17 Int) (v_ArrVal_618 (Array Int Int)) (v_arrayElimCell_16 Int)) (let ((.cse8 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_618) v_arrayElimCell_16))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 v_arrayElimCell_17)))))))) (and (or (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (not (= |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_618 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_618) .cse1) .cse2))) (not .cse3)) (or (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (= |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse4) (forall ((v_ArrVal_618 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_618))) (or (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_16 Int)) (let ((.cse5 (select .cse6 v_arrayElimCell_16))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 v_arrayElimCell_17))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse1) .cse2))))) (forall ((v_ArrVal_618 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_618))) (or (forall ((v_arrayElimCell_17 Int) (v_arrayElimCell_16 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 v_arrayElimCell_16) v_arrayElimCell_17))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse1) .cse2))))) (or .cse3 .cse4))))) is different from false [2024-10-23 23:47:06,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62538823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:06,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:47:06,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2024-10-23 23:47:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511975344] [2024-10-23 23:47:06,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:47:06,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-23 23:47:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:47:06,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-23 23:47:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=746, Unknown=1, NotChecked=54, Total=870 [2024-10-23 23:47:06,481 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-23 23:47:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:06,944 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-10-23 23:47:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-23 23:47:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2024-10-23 23:47:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:06,946 INFO L225 Difference]: With dead ends: 27 [2024-10-23 23:47:06,946 INFO L226 Difference]: Without dead ends: 25 [2024-10-23 23:47:06,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=1295, Unknown=1, NotChecked=72, Total=1482 [2024-10-23 23:47:06,947 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:06,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 138 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 23:47:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-23 23:47:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-23 23:47:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:47:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-23 23:47:06,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 24 [2024-10-23 23:47:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:06,957 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-23 23:47:06,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-23 23:47:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-23 23:47:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:47:06,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:06,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:06,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 23:47:07,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:07,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:07,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash 568910808, now seen corresponding path program 1 times [2024-10-23 23:47:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300891007] [2024-10-23 23:47:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:47:07,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300891007] [2024-10-23 23:47:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300891007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93390089] [2024-10-23 23:47:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:07,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:47:07,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:47:07,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 23:47:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:07,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-23 23:47:07,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:47:08,008 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-23 23:47:08,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-23 23:47:08,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 12 treesize of output 4 [2024-10-23 23:47:08,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-23 23:47:08,171 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-23 23:47:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-10-23 23:47:08,184 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-23 23:47:08,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-23 23:47:08,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-23 23:47:08,248 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 38 treesize of output 26 [2024-10-23 23:47:08,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-23 23:47:08,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-23 23:47:08,330 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-23 23:47:08,331 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2024-10-23 23:47:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 23:47:08,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:47:08,386 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 236 treesize of output 206 [2024-10-23 23:47:08,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:08,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 311 [2024-10-23 23:47:08,673 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-10-23 23:47:08,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-10-23 23:47:08,693 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-10-23 23:47:08,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2024-10-23 23:47:08,781 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-23 23:47:08,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 8 [2024-10-23 23:47:09,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93390089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:09,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:47:09,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 25 [2024-10-23 23:47:09,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227718831] [2024-10-23 23:47:09,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:47:09,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-23 23:47:09,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:47:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-23 23:47:09,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2024-10-23 23:47:09,093 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:47:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:09,543 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-23 23:47:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-23 23:47:09,544 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-10-23 23:47:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:09,545 INFO L225 Difference]: With dead ends: 30 [2024-10-23 23:47:09,545 INFO L226 Difference]: Without dead ends: 27 [2024-10-23 23:47:09,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2024-10-23 23:47:09,546 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:09,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 233 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 23:47:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-23 23:47:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-23 23:47:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:47:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-23 23:47:09,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 26 [2024-10-23 23:47:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:09,554 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-23 23:47:09,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:47:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-23 23:47:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:47:09,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:09,554 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:09,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-23 23:47:09,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:09,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 568912482, now seen corresponding path program 1 times [2024-10-23 23:47:09,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:09,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66742860] [2024-10-23 23:47:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:09,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:47:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66742860] [2024-10-23 23:47:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66742860] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929756628] [2024-10-23 23:47:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:47:11,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:47:11,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 23:47:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:11,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-10-23 23:47:11,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:47:11,250 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-23 23:47:11,254 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-23 23:47:11,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-23 23:47:11,420 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-23 23:47:11,420 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 16 treesize of output 15 [2024-10-23 23:47:11,435 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-23 23:47:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-23 23:47:11,495 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-23 23:47:11,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-10-23 23:47:11,507 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-23 23:47:11,513 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-23 23:47:11,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-23 23:47:11,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-23 23:47:11,650 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-23 23:47:11,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-23 23:47:11,653 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 11 treesize of output 3 [2024-10-23 23:47:11,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:47:11,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-10-23 23:47:11,860 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-23 23:47:11,860 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 40 treesize of output 47 [2024-10-23 23:47:11,890 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-10-23 23:47:11,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-10-23 23:47:11,899 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 20 treesize of output 15 [2024-10-23 23:47:11,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 52 [2024-10-23 23:47:11,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2024-10-23 23:47:11,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2024-10-23 23:47:11,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-10-23 23:47:12,214 INFO L349 Elim1Store]: treesize reduction 32, result has 70.6 percent of original size [2024-10-23 23:47:12,215 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 149 [2024-10-23 23:47:12,272 INFO L349 Elim1Store]: treesize reduction 32, result has 70.6 percent of original size [2024-10-23 23:47:12,272 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 123 [2024-10-23 23:47:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:47:12,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:47:13,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:13,226 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 286 [2024-10-23 23:47:13,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:47:13,235 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 250 [2024-10-23 23:47:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929756628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:13,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:47:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2024-10-23 23:47:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557495261] [2024-10-23 23:47:13,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:47:13,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-23 23:47:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:47:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-23 23:47:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1868, Unknown=3, NotChecked=0, Total=1980 [2024-10-23 23:47:13,382 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 39 states, 32 states have (on average 1.1875) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:47:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:14,601 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-10-23 23:47:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-23 23:47:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.1875) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2024-10-23 23:47:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:14,602 INFO L225 Difference]: With dead ends: 31 [2024-10-23 23:47:14,602 INFO L226 Difference]: Without dead ends: 29 [2024-10-23 23:47:14,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=220, Invalid=3317, Unknown=3, NotChecked=0, Total=3540 [2024-10-23 23:47:14,604 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:14,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 251 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 23:47:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-23 23:47:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-23 23:47:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:47:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-10-23 23:47:14,608 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 26 [2024-10-23 23:47:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:14,608 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-23 23:47:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.1875) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:47:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-10-23 23:47:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:47:14,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:14,609 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:14,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-23 23:47:14,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:14,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:14,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1264080947, now seen corresponding path program 2 times [2024-10-23 23:47:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:14,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333798690] [2024-10-23 23:47:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-23 23:47:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333798690] [2024-10-23 23:47:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333798690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111389657] [2024-10-23 23:47:14,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-23 23:47:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:47:14,950 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:47:14,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-23 23:47:15,086 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-23 23:47:15,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-23 23:47:15,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-23 23:47:15,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:47:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-23 23:47:15,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:47:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-23 23:47:15,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111389657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:47:15,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:47:15,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-10-23 23:47:15,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471970437] [2024-10-23 23:47:15,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:47:15,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 23:47:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:47:15,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 23:47:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-23 23:47:15,159 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 23:47:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:47:15,210 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-23 23:47:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 23:47:15,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-23 23:47:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:47:15,211 INFO L225 Difference]: With dead ends: 36 [2024-10-23 23:47:15,211 INFO L226 Difference]: Without dead ends: 33 [2024-10-23 23:47:15,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-23 23:47:15,212 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:47:15,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:47:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-23 23:47:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-10-23 23:47:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:47:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-23 23:47:15,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 28 [2024-10-23 23:47:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:47:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-23 23:47:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 23:47:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-23 23:47:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:47:15,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:47:15,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:47:15,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-23 23:47:15,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:15,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:47:15,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:47:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1264082621, now seen corresponding path program 2 times [2024-10-23 23:47:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:47:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823373846] [2024-10-23 23:47:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:47:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:47:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-23 23:47:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:47:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:16,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-23 23:47:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:47:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:47:17,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:47:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823373846] [2024-10-23 23:47:17,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823373846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:47:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278378142] [2024-10-23 23:47:17,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-23 23:47:17,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:47:17,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:47:17,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:47:17,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-23 23:47:17,146 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-23 23:47:17,146 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-23 23:47:17,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-10-23 23:47:17,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:47:17,184 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-23 23:47:17,218 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-23 23:47:17,222 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-23 23:47:17,366 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:47:17,366 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 17 treesize of output 21 [2024-10-23 23:47:17,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-23 23:47:17,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-23 23:47:17,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-10-23 23:47:17,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-23 23:47:17,556 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-10-23 23:47:17,556 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 27 [2024-10-23 23:47:17,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-10-23 23:47:17,561 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-23 23:47:17,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:47:17,644 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-23 23:47:17,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 75 [2024-10-23 23:47:17,661 INFO L349 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2024-10-23 23:47:17,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 71 [2024-10-23 23:47:17,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-23 23:47:17,683 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-23 23:47:17,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-10-23 23:47:17,773 INFO L349 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2024-10-23 23:47:17,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 67 [2024-10-23 23:47:17,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2024-10-23 23:47:17,790 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 125 treesize of output 93 [2024-10-23 23:47:17,797 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 125 treesize of output 101 [2024-10-23 23:47:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 23:47:53,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:48:10,497 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-10-23 23:48:10,498 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-23 23:48:10,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-10-23 23:48:10,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-23 23:48:10,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:48:10,700 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-10-23 23:48:10,703 INFO L158 Benchmark]: Toolchain (without parser) took 94032.21ms. Allocated memory was 140.5MB in the beginning and 394.3MB in the end (delta: 253.8MB). Free memory was 62.8MB in the beginning and 139.6MB in the end (delta: -76.9MB). Peak memory consumption was 179.3MB. Max. memory is 16.1GB. [2024-10-23 23:48:10,703 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 140.5MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 23:48:10,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.48ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 62.6MB in the beginning and 154.1MB in the end (delta: -91.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-23 23:48:10,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.81ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 152.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 23:48:10,703 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 148.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 23:48:10,704 INFO L158 Benchmark]: RCFGBuilder took 322.04ms. Allocated memory is still 188.7MB. Free memory was 148.8MB in the beginning and 128.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-23 23:48:10,705 INFO L158 Benchmark]: TraceAbstraction took 93259.79ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 127.8MB in the beginning and 139.6MB in the end (delta: -11.8MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. [2024-10-23 23:48:10,705 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 140.5MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.48ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 62.6MB in the beginning and 154.1MB in the end (delta: -91.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.81ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 152.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 148.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 322.04ms. Allocated memory is still 188.7MB. Free memory was 148.8MB in the beginning and 128.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 93259.79ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 127.8MB in the beginning and 139.6MB in the end (delta: -11.8MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 23:48:12,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 23:48:12,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-23 23:48:12,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 23:48:12,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 23:48:12,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 23:48:12,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 23:48:12,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 23:48:12,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 23:48:12,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 23:48:12,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 23:48:12,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 23:48:12,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 23:48:12,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 23:48:12,298 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 23:48:12,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 23:48:12,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 23:48:12,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 23:48:12,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 23:48:12,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 23:48:12,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 23:48:12,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 23:48:12,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 23:48:12,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 23:48:12,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 23:48:12,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 23:48:12,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 23:48:12,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:48:12,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 23:48:12,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 23:48:12,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 23:48:12,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-23 23:48:12,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-23 23:48:12,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 23:48:12,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 23:48:12,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 23:48:12,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 23:48:12,303 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-23 23:48:12,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-10-23 23:48:12,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 23:48:12,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 23:48:12,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 23:48:12,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 23:48:12,549 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 23:48:12,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-10-23 23:48:13,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 23:48:14,005 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 23:48:14,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-10-23 23:48:14,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08fb6a7e/e1a007887b124845b387991233c1e28a/FLAGc5bbc6476 [2024-10-23 23:48:14,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08fb6a7e/e1a007887b124845b387991233c1e28a [2024-10-23 23:48:14,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 23:48:14,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 23:48:14,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 23:48:14,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 23:48:14,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 23:48:14,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3462202e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14, skipping insertion in model container [2024-10-23 23:48:14,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 23:48:14,668 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-simple/sll2n_prepend_unequal.i[24165,24178] [2024-10-23 23:48:14,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:48:14,680 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 23:48:14,717 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-simple/sll2n_prepend_unequal.i[24165,24178] [2024-10-23 23:48:14,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:48:14,743 INFO L204 MainTranslator]: Completed translation [2024-10-23 23:48:14,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14 WrapperNode [2024-10-23 23:48:14,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 23:48:14,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 23:48:14,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 23:48:14,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 23:48:14,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,780 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2024-10-23 23:48:14,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 23:48:14,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 23:48:14,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 23:48:14,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 23:48:14,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,816 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-10-23 23:48:14,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 23:48:14,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 23:48:14,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 23:48:14,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 23:48:14,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (1/1) ... [2024-10-23 23:48:14,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:48:14,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:48:14,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 23:48:14,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-23 23:48:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 23:48:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-23 23:48:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-23 23:48:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-23 23:48:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-23 23:48:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-23 23:48:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-23 23:48:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-23 23:48:14,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-23 23:48:14,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-23 23:48:14,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 23:48:14,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 23:48:15,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 23:48:15,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 23:48:15,238 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-23 23:48:15,238 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 23:48:15,286 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 23:48:15,287 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-23 23:48:15,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:48:15 BoogieIcfgContainer [2024-10-23 23:48:15,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 23:48:15,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 23:48:15,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 23:48:15,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 23:48:15,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:48:14" (1/3) ... [2024-10-23 23:48:15,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415aa545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:48:15, skipping insertion in model container [2024-10-23 23:48:15,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:48:14" (2/3) ... [2024-10-23 23:48:15,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415aa545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:48:15, skipping insertion in model container [2024-10-23 23:48:15,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:48:15" (3/3) ... [2024-10-23 23:48:15,295 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-10-23 23:48:15,309 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 23:48:15,309 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 23:48:15,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 23:48:15,364 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;@1bce8265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 23:48:15,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 23:48:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:48:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-23 23:48:15,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:48:15,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:48:15,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:48:15,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:48:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1027000244, now seen corresponding path program 1 times [2024-10-23 23:48:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 23:48:15,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32747219] [2024-10-23 23:48:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:48:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 23:48:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 23:48:15,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 23:48:15,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-23 23:48:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:48:15,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-23 23:48:15,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:48:15,540 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-23 23:48:15,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 23:48:15,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 23:48:15,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32747219] [2024-10-23 23:48:15,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32747219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:48:15,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:48:15,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 23:48:15,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260813502] [2024-10-23 23:48:15,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:48:15,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 23:48:15,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 23:48:15,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 23:48:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 23:48:15,565 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:48:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:48:15,659 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2024-10-23 23:48:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 23:48:15,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-23 23:48:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:48:15,670 INFO L225 Difference]: With dead ends: 38 [2024-10-23 23:48:15,670 INFO L226 Difference]: Without dead ends: 16 [2024-10-23 23:48:15,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-23 23:48:15,674 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 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.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:48:15,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:48:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-23 23:48:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-23 23:48:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:48:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-23 23:48:15,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2024-10-23 23:48:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:48:15,696 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-23 23:48:15,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 23:48:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-10-23 23:48:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-23 23:48:15,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:48:15,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:48:15,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0