./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.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 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:08:58,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:08:58,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:08:58,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:08:58,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:08:59,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:08:59,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:08:59,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:08:59,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:08:59,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:08:59,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:08:59,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:08:59,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:08:59,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:08:59,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:08:59,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:08:59,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:08:59,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:08:59,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:08:59,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:08:59,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:08:59,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:08:59,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:08:59,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:08:59,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:08:59,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:08:59,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:08:59,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:08:59,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:08:59,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:08:59,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:08:59,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:08:59,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:08:59,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:08:59,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:08:59,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:08:59,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:08:59,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:08:59,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:08:59,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:08:59,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:08:59,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:08:59,030 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2024-11-09 22:08:59,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:08:59,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:08:59,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:08:59,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:08:59,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:08:59,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2024-11-09 22:09:00,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:09:00,940 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:09:00,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2024-11-09 22:09:00,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b73d4cf5/c8f0ad26dfcb411eacb60bd562c80a09/FLAG44e3634a4 [2024-11-09 22:09:01,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b73d4cf5/c8f0ad26dfcb411eacb60bd562c80a09 [2024-11-09 22:09:01,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:09:01,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:09:01,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:01,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:09:01,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:09:01,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef13168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01, skipping insertion in model container [2024-11-09 22:09:01,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:09:01,683 WARN L250 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/sll2c_remove_all_reverse.i[24151,24164] [2024-11-09 22:09:01,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:01,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:09:01,740 WARN L250 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/sll2c_remove_all_reverse.i[24151,24164] [2024-11-09 22:09:01,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:09:01,772 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:09:01,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01 WrapperNode [2024-11-09 22:09:01,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:09:01,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:01,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:09:01,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:09:01,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,815 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-11-09 22:09:01,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:09:01,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:09:01,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:09:01,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:09:01,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,850 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-09 22:09:01,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:09:01,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:09:01,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:09:01,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:09:01,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (1/1) ... [2024-11-09 22:09:01,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:09:01,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:01,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:09:01,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:09:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:09:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:09:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:09:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:09:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:09:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:09:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:09:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:09:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:09:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:09:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:09:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:09:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:09:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:09:01,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:09:01,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:09:02,119 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:09:02,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:09:02,300 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:09:02,337 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:09:02,349 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 22:09:02,349 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:09:02,360 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:09:02,360 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:09:02,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:02 BoogieIcfgContainer [2024-11-09 22:09:02,361 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:09:02,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:09:02,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:09:02,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:09:02,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:09:01" (1/3) ... [2024-11-09 22:09:02,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281363fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:02, skipping insertion in model container [2024-11-09 22:09:02,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:01" (2/3) ... [2024-11-09 22:09:02,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281363fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:02, skipping insertion in model container [2024-11-09 22:09:02,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:09:02" (3/3) ... [2024-11-09 22:09:02,367 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2024-11-09 22:09:02,379 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:09:02,379 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:09:02,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:09:02,434 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;@7fbd04e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:09:02,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:09:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:09:02,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:02,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:02,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash 98106344, now seen corresponding path program 1 times [2024-11-09 22:09:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402833482] [2024-11-09 22:09:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402833482] [2024-11-09 22:09:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402833482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:02,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:09:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878731107] [2024-11-09 22:09:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:02,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:09:02,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:09:02,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:09:02,770 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 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 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:02,826 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-09 22:09:02,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:09:02,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2024-11-09 22:09:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:02,832 INFO L225 Difference]: With dead ends: 55 [2024-11-09 22:09:02,832 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 22:09:02,834 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-11-09 22:09:02,837 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:02,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 22:09:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 22:09:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 22:09:02,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 17 [2024-11-09 22:09:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:02,882 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 22:09:02,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 22:09:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:09:02,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:02,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:09:02,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -411437144, now seen corresponding path program 1 times [2024-11-09 22:09:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962454578] [2024-11-09 22:09:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:03,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:03,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962454578] [2024-11-09 22:09:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962454578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:03,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:03,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:09:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112222410] [2024-11-09 22:09:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:03,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:09:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:03,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:09:03,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:09:03,087 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:03,124 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-09 22:09:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:09:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 22:09:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:03,125 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:09:03,126 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 22:09:03,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-09 22:09:03,127 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:03,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 22:09:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 22:09:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 22:09:03,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2024-11-09 22:09:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 22:09:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:09:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 22:09:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:09:03,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:03,135 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:03,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:09:03,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:03,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -448002256, now seen corresponding path program 1 times [2024-11-09 22:09:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:03,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065828341] [2024-11-09 22:09:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065828341] [2024-11-09 22:09:03,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065828341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:03,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:03,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:09:03,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466304853] [2024-11-09 22:09:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:03,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:09:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:03,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:09:03,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:09:03,342 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:03,408 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-11-09 22:09:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:09:03,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-09 22:09:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:03,411 INFO L225 Difference]: With dead ends: 47 [2024-11-09 22:09:03,412 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 22:09:03,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:09:03,414 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:03,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 22:09:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2024-11-09 22:09:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 22:09:03,428 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2024-11-09 22:09:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:03,428 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 22:09:03,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 22:09:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 22:09:03,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:03,431 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:03,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:09:03,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:03,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1348373283, now seen corresponding path program 1 times [2024-11-09 22:09:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:03,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801535352] [2024-11-09 22:09:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801535352] [2024-11-09 22:09:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801535352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793876004] [2024-11-09 22:09:03,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:03,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:03,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:03,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:03,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:09:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:03,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 22:09:03,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:03,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:04,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793876004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:04,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-09 22:09:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467055154] [2024-11-09 22:09:04,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:04,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:09:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:09:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:04,090 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:09:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:04,169 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-09 22:09:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:09:04,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-09 22:09:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:04,171 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:09:04,172 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:09:04,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:09:04,175 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:04,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 127 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:09:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 22:09:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-09 22:09:04,185 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 35 [2024-11-09 22:09:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:04,186 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-09 22:09:04,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:09:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-09 22:09:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 22:09:04,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:04,188 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:04,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:09:04,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:04,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1628259696, now seen corresponding path program 2 times [2024-11-09 22:09:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020018709] [2024-11-09 22:09:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:09:04,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:04,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020018709] [2024-11-09 22:09:04,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020018709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:04,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:04,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:09:04,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806672599] [2024-11-09 22:09:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:04,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:09:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:09:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:04,742 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:04,837 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-09 22:09:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:09:04,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-09 22:09:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:04,839 INFO L225 Difference]: With dead ends: 62 [2024-11-09 22:09:04,839 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:09:04,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:09:04,840 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:04,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:09:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 22:09:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-09 22:09:04,852 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 42 [2024-11-09 22:09:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-09 22:09:04,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-09 22:09:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 22:09:04,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:04,854 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:04,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:09:04,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:04,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2066740900, now seen corresponding path program 1 times [2024-11-09 22:09:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178948472] [2024-11-09 22:09:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 22:09:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178948472] [2024-11-09 22:09:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178948472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:09:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:09:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609317326] [2024-11-09 22:09:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:09:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:09:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:09:04,990 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:05,040 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-11-09 22:09:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:09:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-09 22:09:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:05,042 INFO L225 Difference]: With dead ends: 73 [2024-11-09 22:09:05,042 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 22:09:05,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:09:05,043 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:05,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 22:09:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 22:09:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-09 22:09:05,050 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 48 [2024-11-09 22:09:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:05,050 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-09 22:09:05,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:09:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-09 22:09:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 22:09:05,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:05,051 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:05,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:09:05,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:05,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 767827226, now seen corresponding path program 1 times [2024-11-09 22:09:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:05,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34273145] [2024-11-09 22:09:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:09:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34273145] [2024-11-09 22:09:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34273145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37284080] [2024-11-09 22:09:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:05,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:05,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:05,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:05,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:09:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-09 22:09:05,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:06,158 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 23 treesize of output 15 [2024-11-09 22:09:06,164 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 19 treesize of output 11 [2024-11-09 22:09:06,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:09:06,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:09:06,335 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-09 22:09:06,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 30 [2024-11-09 22:09:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:09:06,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:06,895 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 64 treesize of output 52 [2024-11-09 22:09:06,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:09:06,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:09:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:09:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37284080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:07,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:07,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 10] total 29 [2024-11-09 22:09:07,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518026243] [2024-11-09 22:09:07,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:07,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 22:09:07,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:07,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 22:09:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2024-11-09 22:09:07,049 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 27 states have internal predecessors, (93), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:09:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:07,438 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-11-09 22:09:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:09:07,439 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 27 states have internal predecessors, (93), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-09 22:09:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:07,440 INFO L225 Difference]: With dead ends: 82 [2024-11-09 22:09:07,440 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 22:09:07,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2024-11-09 22:09:07,441 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:07,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 391 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:09:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 22:09:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-11-09 22:09:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-09 22:09:07,449 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 52 [2024-11-09 22:09:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:07,450 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-09 22:09:07,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 27 states have internal predecessors, (93), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:09:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-09 22:09:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 22:09:07,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:07,451 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:07,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:09:07,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 22:09:07,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:07,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 690519609, now seen corresponding path program 1 times [2024-11-09 22:09:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:07,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7662942] [2024-11-09 22:09:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:07,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 22:09:07,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:07,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7662942] [2024-11-09 22:09:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7662942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:07,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048439677] [2024-11-09 22:09:07,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:07,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:07,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:07,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:07,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:09:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:08,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-09 22:09:08,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:08,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:09:08,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:09:08,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:09:08,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:08,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:08,518 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:09:08,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 22:09:08,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 22:09:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:09:08,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 22:09:09,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048439677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:09,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:09,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 10] total 28 [2024-11-09 22:09:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497927787] [2024-11-09 22:09:09,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:09,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 22:09:09,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 22:09:09,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2024-11-09 22:09:09,212 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 24 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:09,767 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2024-11-09 22:09:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 22:09:09,768 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 24 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-09 22:09:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:09,770 INFO L225 Difference]: With dead ends: 123 [2024-11-09 22:09:09,770 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 22:09:09,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 22:09:09,772 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:09,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 361 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:09:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 22:09:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2024-11-09 22:09:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:09:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 22:09:09,781 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 54 [2024-11-09 22:09:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:09,781 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 22:09:09,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 24 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:09:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-09 22:09:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 22:09:09,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:09,782 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:09,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:09:09,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:09,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:09,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 566105112, now seen corresponding path program 2 times [2024-11-09 22:09:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:09,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961823704] [2024-11-09 22:09:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:11,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:11,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:11,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961823704] [2024-11-09 22:09:11,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961823704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125847406] [2024-11-09 22:09:11,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:09:11,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:11,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:11,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:09:11,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:09:11,798 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:09:11,799 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:09:11,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 175 conjuncts are in the unsatisfiable core [2024-11-09 22:09:11,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:11,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:09:12,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 22:09:12,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 22:09:12,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:12,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:12,288 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 22:09:12,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2024-11-09 22:09:12,294 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 22 [2024-11-09 22:09:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 22:09:12,700 INFO L311 TraceCheckSpWp]: Computing backward predicates...