./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_equal.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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:55:08,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:55:08,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:55:08,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:55:08,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:55:09,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:55:09,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:55:09,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:55:09,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:55:09,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:55:09,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:55:09,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:55:09,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:55:09,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:55:09,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:55:09,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:55:09,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:55:09,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:55:09,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:55:09,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:55:09,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:55:09,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:55:09,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:55:09,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:55:09,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:55:09,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:55:09,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:55:09,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:55:09,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:55:09,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:55:09,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:55:09,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:55:09,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:55:09,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:55:09,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:55:09,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:55:09,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:55:09,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:55:09,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:55:09,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:55:09,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:55:09,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:55:09,034 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2024-11-22 00:55:09,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:55:09,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:55:09,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:55:09,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:55:09,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:55:09,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-22 00:55:10,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:55:11,062 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:55:11,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2024-11-22 00:55:11,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5336f713/b6d0347f47224089841bbec403b87603/FLAG5240ced51 [2024-11-22 00:55:11,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5336f713/b6d0347f47224089841bbec403b87603 [2024-11-22 00:55:11,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:55:11,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:55:11,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:55:11,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:55:11,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:55:11,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7c5d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11, skipping insertion in model container [2024-11-22 00:55:11,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:55:11,467 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/sll2n_append_equal.i[24197,24210] [2024-11-22 00:55:11,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:55:11,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:55:11,562 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/sll2n_append_equal.i[24197,24210] [2024-11-22 00:55:11,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:55:11,601 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:55:11,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11 WrapperNode [2024-11-22 00:55:11,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:55:11,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:55:11,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:55:11,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:55:11,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,655 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-11-22 00:55:11,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:55:11,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:55:11,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:55:11,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:55:11,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,701 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-11-22 00:55:11,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:55:11,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:55:11,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:55:11,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:55:11,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (1/1) ... [2024-11-22 00:55:11,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:55:11,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:11,765 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-22 00:55:11,767 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-22 00:55:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:55:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:55:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 00:55:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-22 00:55:11,809 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:55:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 00:55:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 00:55:11,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:55:11,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:55:11,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 00:55:11,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:55:11,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:55:11,924 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:55:11,926 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:55:12,097 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-22 00:55:12,097 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:55:12,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:55:12,115 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 00:55:12,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:55:12 BoogieIcfgContainer [2024-11-22 00:55:12,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:55:12,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:55:12,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:55:12,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:55:12,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:55:11" (1/3) ... [2024-11-22 00:55:12,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bdb3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:55:12, skipping insertion in model container [2024-11-22 00:55:12,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:11" (2/3) ... [2024-11-22 00:55:12,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bdb3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:55:12, skipping insertion in model container [2024-11-22 00:55:12,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:55:12" (3/3) ... [2024-11-22 00:55:12,128 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2024-11-22 00:55:12,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:55:12,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:55:12,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:55:12,195 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;@67c75e34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:55:12,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:55:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 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-22 00:55:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 00:55:12,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:12,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:12,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:12,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2024-11-22 00:55:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:12,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403204927] [2024-11-22 00:55:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:12,475 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-22 00:55:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403204927] [2024-11-22 00:55:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403204927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:55:12,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:55:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:55:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004710764] [2024-11-22 00:55:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:55:12,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:55:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:55:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:55:12,526 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.5) 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-22 00:55:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:12,548 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-22 00:55:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:55:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) 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-22 00:55:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:12,558 INFO L225 Difference]: With dead ends: 56 [2024-11-22 00:55:12,558 INFO L226 Difference]: Without dead ends: 25 [2024-11-22 00:55:12,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:55:12,567 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:12,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:55:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-22 00:55:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-22 00:55:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-22 00:55:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-22 00:55:12,610 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2024-11-22 00:55:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:12,611 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-22 00:55:12,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) 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-22 00:55:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-22 00:55:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 00:55:12,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:12,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:12,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:55:12,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2024-11-22 00:55:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863672789] [2024-11-22 00:55:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:12,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:12,814 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-22 00:55:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863672789] [2024-11-22 00:55:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863672789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:55:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:55:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:55:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295743998] [2024-11-22 00:55:12,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:55:12,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:55:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:12,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:55:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:55:12,820 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-22 00:55:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:12,840 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-11-22 00:55:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:55:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-22 00:55:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:12,842 INFO L225 Difference]: With dead ends: 48 [2024-11-22 00:55:12,842 INFO L226 Difference]: Without dead ends: 29 [2024-11-22 00:55:12,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:55:12,845 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:12,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:55:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-22 00:55:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-22 00:55:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:55:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-22 00:55:12,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2024-11-22 00:55:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:12,856 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-22 00:55:12,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-22 00:55:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-22 00:55:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 00:55:12,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:12,858 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:12,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:55:12,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:12,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2024-11-22 00:55:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555916210] [2024-11-22 00:55:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:12,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:55:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555916210] [2024-11-22 00:55:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555916210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240371107] [2024-11-22 00:55:13,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:13,029 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-22 00:55:13,048 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-22 00:55:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:13,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:55:13,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:13,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:55:13,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240371107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:55:13,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:55:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-22 00:55:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705101405] [2024-11-22 00:55:13,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:13,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:55:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:55:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:55:13,347 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 00:55:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:13,375 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2024-11-22 00:55:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:55:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-22 00:55:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:13,378 INFO L225 Difference]: With dead ends: 49 [2024-11-22 00:55:13,378 INFO L226 Difference]: Without dead ends: 30 [2024-11-22 00:55:13,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:55:13,379 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:13,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:55:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-22 00:55:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-22 00:55:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:55:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-22 00:55:13,388 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2024-11-22 00:55:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:13,388 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-22 00:55:13,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 00:55:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-22 00:55:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 00:55:13,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:13,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:13,401 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-22 00:55:13,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:13,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:13,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2024-11-22 00:55:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313014989] [2024-11-22 00:55:13,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:55:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:13,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 00:55:13,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:55:13,865 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-22 00:55:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313014989] [2024-11-22 00:55:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313014989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:55:13,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:55:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 00:55:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880896120] [2024-11-22 00:55:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:55:13,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 00:55:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 00:55:13,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:55:13,867 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:55:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:13,956 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-22 00:55:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 00:55:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-22 00:55:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:13,959 INFO L225 Difference]: With dead ends: 40 [2024-11-22 00:55:13,959 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 00:55:13,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 00:55:13,962 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:13,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 167 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:55:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 00:55:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2024-11-22 00:55:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:55:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-22 00:55:13,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2024-11-22 00:55:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:13,970 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-22 00:55:13,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:55:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-22 00:55:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 00:55:13,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:13,973 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:13,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 00:55:13,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2024-11-22 00:55:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441179960] [2024-11-22 00:55:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:13,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:14,487 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-22 00:55:14,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441179960] [2024-11-22 00:55:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441179960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:55:14,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:55:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 00:55:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639720000] [2024-11-22 00:55:14,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:55:14,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 00:55:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:14,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 00:55:14,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-22 00:55:14,489 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:55:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:14,658 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-22 00:55:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 00:55:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-22 00:55:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:14,660 INFO L225 Difference]: With dead ends: 40 [2024-11-22 00:55:14,660 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 00:55:14,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-22 00:55:14,661 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:14,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 149 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:55:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 00:55:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-11-22 00:55:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:55:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-22 00:55:14,667 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2024-11-22 00:55:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:14,668 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-22 00:55:14,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:55:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-22 00:55:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:55:14,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:14,669 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:14,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:55:14,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash -13708553, now seen corresponding path program 1 times [2024-11-22 00:55:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524926875] [2024-11-22 00:55:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 00:55:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524926875] [2024-11-22 00:55:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524926875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160254370] [2024-11-22 00:55:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:14,976 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-22 00:55:14,978 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-22 00:55:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:15,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 00:55:15,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:15,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-22 00:55:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 00:55:15,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 00:55:15,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160254370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:55:15,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:55:15,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2024-11-22 00:55:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10204384] [2024-11-22 00:55:15,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 00:55:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:15,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 00:55:15,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 00:55:15,344 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 00:55:19,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 00:55:23,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 00:55:27,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 00:55:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:27,514 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-22 00:55:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 00:55:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-22 00:55:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:27,516 INFO L225 Difference]: With dead ends: 43 [2024-11-22 00:55:27,516 INFO L226 Difference]: Without dead ends: 35 [2024-11-22 00:55:27,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-22 00:55:27,517 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:27,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 210 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-11-22 00:55:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-22 00:55:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-22 00:55:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:55:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-22 00:55:27,522 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 37 [2024-11-22 00:55:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:27,523 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-22 00:55:27,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 00:55:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-22 00:55:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 00:55:27,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:27,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:27,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 00:55:27,724 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,SelfDestructingSolverStorable5 [2024-11-22 00:55:27,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2024-11-22 00:55:27,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:27,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864337075] [2024-11-22 00:55:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 00:55:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864337075] [2024-11-22 00:55:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864337075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250380506] [2024-11-22 00:55:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:27,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:27,895 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-22 00:55:27,896 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-22 00:55:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:28,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 00:55:28,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:28,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-22 00:55:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:55:28,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 00:55:28,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250380506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:55:28,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:55:28,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2024-11-22 00:55:28,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233594567] [2024-11-22 00:55:28,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:28,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 00:55:28,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:28,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 00:55:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-22 00:55:28,149 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 00:55:32,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 00:55:36,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 00:55:40,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 00:55:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:40,283 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-22 00:55:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 00:55:40,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-22 00:55:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:40,284 INFO L225 Difference]: With dead ends: 39 [2024-11-22 00:55:40,284 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 00:55:40,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 00:55:40,285 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:40,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2024-11-22 00:55:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 00:55:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-22 00:55:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:55:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-22 00:55:40,297 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 38 [2024-11-22 00:55:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:40,297 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-22 00:55:40,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-22 00:55:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-22 00:55:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 00:55:40,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:40,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:40,313 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-22 00:55:40,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:40,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2024-11-22 00:55:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:40,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941905603] [2024-11-22 00:55:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 00:55:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941905603] [2024-11-22 00:55:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941905603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372292520] [2024-11-22 00:55:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:41,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:41,454 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-22 00:55:41,455 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-22 00:55:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:41,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-22 00:55:41,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:41,724 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-22 00:55:41,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 00:55:41,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 00:55:41,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-22 00:55:41,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 00:55:42,094 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_37| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_37|) 0) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_37| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_37|)))))) is different from true [2024-11-22 00:55:42,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:55:42,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 00:55:42,155 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 00:55:42,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-22 00:55:42,350 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 39 treesize of output 15 [2024-11-22 00:55:42,403 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 19 treesize of output 11 [2024-11-22 00:55:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-22 00:55:42,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372292520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:42,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:55:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-22 00:55:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249040936] [2024-11-22 00:55:42,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:42,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-22 00:55:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-22 00:55:42,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=894, Unknown=1, NotChecked=60, Total=1056 [2024-11-22 00:55:42,730 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 00:55:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:43,257 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-22 00:55:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 00:55:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-22 00:55:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:43,259 INFO L225 Difference]: With dead ends: 49 [2024-11-22 00:55:43,259 INFO L226 Difference]: Without dead ends: 47 [2024-11-22 00:55:43,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=1491, Unknown=1, NotChecked=78, Total=1722 [2024-11-22 00:55:43,262 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:43,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 193 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 387 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2024-11-22 00:55:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-22 00:55:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-11-22 00:55:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:55:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-22 00:55:43,270 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 38 [2024-11-22 00:55:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:43,270 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-22 00:55:43,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 00:55:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-22 00:55:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 00:55:43,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:43,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-22 00:55:43,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 00:55:43,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:43,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:43,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:43,478 INFO L85 PathProgramCache]: Analyzing trace with hash 850134067, now seen corresponding path program 1 times [2024-11-22 00:55:43,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:43,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197241372] [2024-11-22 00:55:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 00:55:44,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:44,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197241372] [2024-11-22 00:55:44,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197241372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:44,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293265140] [2024-11-22 00:55:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:44,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:44,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:44,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:55:44,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 00:55:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:44,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-22 00:55:44,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:44,411 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-22 00:55:44,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 00:55:44,583 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 18 treesize of output 4 [2024-11-22 00:55:44,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 00:55:44,606 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_46| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_46|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_46| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_46|)) |c_#memory_$Pointer$#2.base|))) is different from true [2024-11-22 00:55:44,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:55:44,617 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-22 00:55:44,623 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 00:55:44,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-22 00:55:44,721 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2024-11-22 00:55:44,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2024-11-22 00:55:44,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-22 00:55:44,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-22 00:55:44,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-22 00:55:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-22 00:55:44,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293265140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:45,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:55:45,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 31 [2024-11-22 00:55:45,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857402680] [2024-11-22 00:55:45,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:45,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-22 00:55:45,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:45,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-22 00:55:45,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=966, Unknown=5, NotChecked=62, Total=1122 [2024-11-22 00:55:45,056 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 00:55:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:45,530 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-11-22 00:55:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 00:55:45,531 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2024-11-22 00:55:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:45,532 INFO L225 Difference]: With dead ends: 52 [2024-11-22 00:55:45,532 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 00:55:45,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=1584, Unknown=5, NotChecked=80, Total=1806 [2024-11-22 00:55:45,534 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:45,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 351 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 534 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2024-11-22 00:55:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 00:55:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-22 00:55:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:55:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-22 00:55:45,541 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 40 [2024-11-22 00:55:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:45,541 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-22 00:55:45,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 00:55:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-22 00:55:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 00:55:45,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:45,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:45,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 00:55:45,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:45,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:45,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2024-11-22 00:55:45,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:45,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896200345] [2024-11-22 00:55:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:47,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896200345] [2024-11-22 00:55:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896200345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644901935] [2024-11-22 00:55:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:47,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:47,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:47,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:55:47,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 00:55:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:47,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-22 00:55:47,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:47,270 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-22 00:55:47,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 00:55:47,482 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:55:47,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 00:55:47,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 00:55:47,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 00:55:47,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-22 00:55:47,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-22 00:55:47,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 00:55:47,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 00:55:47,923 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_55| Int)) (let ((.cse0 (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_55|))) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_55| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_55|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_55|)) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_55| .cse0) |c_#memory_int#2|) (= (select .cse0 0) |c_node_create_#in~data#1|)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0))) is different from true [2024-11-22 00:55:47,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:55:47,962 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 38 treesize of output 27 [2024-11-22 00:55:47,986 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-22 00:55:47,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 00:55:47,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 00:55:48,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-22 00:55:48,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-22 00:55:48,480 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 27 treesize of output 15 [2024-11-22 00:55:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-22 00:55:48,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:56:20,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:56:20,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 72 [2024-11-22 00:56:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644901935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:56:20,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:56:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2024-11-22 00:56:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243094240] [2024-11-22 00:56:20,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:56:20,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-22 00:56:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:56:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-22 00:56:20,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1747, Unknown=3, NotChecked=84, Total=1980 [2024-11-22 00:56:20,561 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 34 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:56:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:56:21,835 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-22 00:56:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 00:56:21,835 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 34 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-22 00:56:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:56:21,837 INFO L225 Difference]: With dead ends: 56 [2024-11-22 00:56:21,837 INFO L226 Difference]: Without dead ends: 54 [2024-11-22 00:56:21,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=235, Invalid=2736, Unknown=3, NotChecked=106, Total=3080 [2024-11-22 00:56:21,839 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 00:56:21,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 389 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 725 Invalid, 0 Unknown, 55 Unchecked, 0.7s Time] [2024-11-22 00:56:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-22 00:56:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-11-22 00:56:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:56:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-22 00:56:21,849 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 40 [2024-11-22 00:56:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:56:21,849 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-22 00:56:21,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 34 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:56:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-22 00:56:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 00:56:21,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:56:21,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:56:21,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 00:56:22,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:56:22,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:56:22,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:56:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1294861784, now seen corresponding path program 1 times [2024-11-22 00:56:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:56:22,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455915343] [2024-11-22 00:56:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:56:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:56:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:56:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:56:24,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:56:24,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455915343] [2024-11-22 00:56:24,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455915343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:56:24,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711877951] [2024-11-22 00:56:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:56:24,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:56:24,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:56:24,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:56:24,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 00:56:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:56:24,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-22 00:56:24,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:56:24,931 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-22 00:56:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 00:56:25,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 00:56:25,274 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 00:56:25,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 00:56:25,301 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:56:25,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 00:56:25,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 00:56:25,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 00:56:25,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-22 00:56:25,696 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 63 treesize of output 21 [2024-11-22 00:56:25,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-22 00:56:25,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 00:56:25,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 00:56:25,784 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_64| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_64| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_64|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_64| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_64|))) (= |c_#memory_int#2| (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_64| (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_64|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_64|) 0))) is different from true [2024-11-22 00:56:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:56:25,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2024-11-22 00:56:25,833 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 00:56:25,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 00:56:25,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-22 00:56:25,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-22 00:56:26,172 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-11-22 00:56:26,172 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 177 treesize of output 134 [2024-11-22 00:56:26,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:56:26,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 25 [2024-11-22 00:56:26,184 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 54 treesize of output 21 [2024-11-22 00:56:26,258 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 68 treesize of output 48 [2024-11-22 00:56:26,260 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 52 treesize of output 36 [2024-11-22 00:56:26,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-22 00:56:26,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 00:56:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-22 00:56:26,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:56:26,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_956 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_956)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_955) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_958) .cse0) .cse1))))) is different from false [2024-11-22 00:56:26,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_30| Int) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_30| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| .cse1 (store (select |c_#memory_int#2| .cse1) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_30| 4) v_ArrVal_956)) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_955) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_958) .cse2) .cse3))))))) is different from false [2024-11-22 00:56:26,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_30| Int) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_956 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_30| (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| .cse2 (store (select |c_#memory_int#2| .cse2) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_30| 4) v_ArrVal_956)) (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_955) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_958) .cse3) .cse4))))))) is different from false [2024-11-22 00:56:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711877951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:56:27,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:56:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 46 [2024-11-22 00:56:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554566361] [2024-11-22 00:56:27,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:56:27,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-22 00:56:27,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:56:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-22 00:56:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2126, Unknown=4, NotChecked=380, Total=2652 [2024-11-22 00:56:27,053 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 46 states, 44 states have (on average 1.5) internal successors, (66), 39 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:56:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:56:29,215 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-22 00:56:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 00:56:29,216 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 39 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-22 00:56:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:56:29,216 INFO L225 Difference]: With dead ends: 57 [2024-11-22 00:56:29,217 INFO L226 Difference]: Without dead ends: 55 [2024-11-22 00:56:29,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=308, Invalid=4126, Unknown=4, NotChecked=532, Total=4970 [2024-11-22 00:56:29,218 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 00:56:29,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 421 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 905 Invalid, 0 Unknown, 53 Unchecked, 0.8s Time] [2024-11-22 00:56:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-22 00:56:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-11-22 00:56:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:56:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-22 00:56:29,227 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 42 [2024-11-22 00:56:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:56:29,228 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-22 00:56:29,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5) internal successors, (66), 39 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:56:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-22 00:56:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 00:56:29,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:56:29,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:56:29,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-22 00:56:29,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:56:29,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:56:29,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:56:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash 848307608, now seen corresponding path program 2 times [2024-11-22 00:56:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:56:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582451912] [2024-11-22 00:56:29,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:56:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:56:29,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:56:29,483 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:56:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:56:32,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:56:32,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582451912] [2024-11-22 00:56:32,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582451912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:56:32,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876155956] [2024-11-22 00:56:32,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:56:32,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:56:32,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:56:32,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:56:32,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 00:56:32,569 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:56:32,570 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:56:32,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-22 00:56:32,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:56:32,643 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-22 00:56:32,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 00:56:32,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 00:56:33,024 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 00:56:33,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 00:56:33,043 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 00:56:33,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-22 00:56:33,135 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-22 00:56:33,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2024-11-22 00:56:33,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 00:56:33,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 00:56:33,464 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 29 treesize of output 13 [2024-11-22 00:56:33,472 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 00:56:33,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 00:56:33,478 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 00:56:33,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-22 00:56:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-22 00:56:33,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 00:56:33,665 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_73| Int)) (let ((.cse0 (select |c_#memory_int#2| |v_node_create_~temp~0#1.base_73|))) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_73| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_73|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_73| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_73|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_73|) 0) (= (store |c_old(#memory_int#2)| |v_node_create_~temp~0#1.base_73| .cse0) |c_#memory_int#2|) (= |c_node_create_#in~data#1| (select .cse0 0)))))) is different from true [2024-11-22 00:56:33,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:56:33,716 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 37 treesize of output 26 [2024-11-22 00:56:33,747 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-22 00:56:33,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 00:56:33,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 00:56:33,770 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-22 00:56:33,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2024-11-22 00:56:34,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-22 00:56:34,313 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 00:56:34,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-22 00:56:34,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-22 00:56:34,594 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 27 treesize of output 15 [2024-11-22 00:56:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-22 00:56:34,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:56:35,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:56:35,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 81 [2024-11-22 00:56:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876155956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:56:35,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:56:35,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 48 [2024-11-22 00:56:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924822879] [2024-11-22 00:56:35,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:56:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-22 00:56:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:56:35,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-22 00:56:35,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2492, Unknown=1, NotChecked=100, Total=2756 [2024-11-22 00:56:35,555 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 48 states, 46 states have (on average 1.434782608695652) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:56:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:56:37,915 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-11-22 00:56:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-22 00:56:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.434782608695652) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-22 00:56:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:56:37,916 INFO L225 Difference]: With dead ends: 64 [2024-11-22 00:56:37,916 INFO L226 Difference]: Without dead ends: 62 [2024-11-22 00:56:37,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=344, Invalid=4629, Unknown=1, NotChecked=138, Total=5112 [2024-11-22 00:56:37,918 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 00:56:37,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 336 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 812 Invalid, 0 Unknown, 59 Unchecked, 0.9s Time] [2024-11-22 00:56:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-22 00:56:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-11-22 00:56:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:56:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-22 00:56:37,932 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 42 [2024-11-22 00:56:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:56:37,933 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-22 00:56:37,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.434782608695652) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:56:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-22 00:56:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 00:56:37,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:56:37,933 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:56:37,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-22 00:56:38,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-22 00:56:38,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:56:38,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:56:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1178308631, now seen corresponding path program 1 times [2024-11-22 00:56:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:56:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599407414] [2024-11-22 00:56:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:56:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:56:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:56:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:56:40,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:56:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599407414] [2024-11-22 00:56:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599407414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:56:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11215388] [2024-11-22 00:56:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:56:40,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:56:40,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:56:40,569 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:56:40,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 00:56:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:56:40,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-22 00:56:40,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:56:40,776 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