./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:50:22,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:50:22,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:50:22,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:50:22,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:50:22,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:50:22,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:50:22,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:50:22,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:50:22,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:50:22,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:50:22,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:50:22,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:50:22,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:50:22,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:50:22,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:50:22,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:50:22,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:50:22,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:50:22,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:50:22,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:50:22,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:50:22,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:50:22,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:50:22,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:50:22,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:50:22,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:50:22,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:50:22,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:50:22,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:50:22,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:50:22,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:50:22,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:50:22,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:50:22,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:50:22,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:50:22,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:50:22,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:50:22,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:50:22,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:50:22,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:50:22,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:50:22,801 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2024-11-19 20:50:23,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:50:23,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:50:23,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:50:23,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:50:23,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:50:23,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2024-11-19 20:50:24,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:50:24,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:50:24,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2024-11-19 20:50:24,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a45eccf/7755aabfdb5a4e85a89bb77d00d06866/FLAG5046c2c38 [2024-11-19 20:50:25,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a45eccf/7755aabfdb5a4e85a89bb77d00d06866 [2024-11-19 20:50:25,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:50:25,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:50:25,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:50:25,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:50:25,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:50:25,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b2b86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25, skipping insertion in model container [2024-11-19 20:50:25,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:50:25,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2024-11-19 20:50:25,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:50:25,472 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:50:25,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2024-11-19 20:50:25,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:50:25,552 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:50:25,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25 WrapperNode [2024-11-19 20:50:25,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:50:25,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:50:25,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:50:25,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:50:25,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,605 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2024-11-19 20:50:25,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:50:25,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:50:25,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:50:25,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:50:25,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,644 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 13, 9]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2024-11-19 20:50:25,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:50:25,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:50:25,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:50:25,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:50:25,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (1/1) ... [2024-11-19 20:50:25,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:50:25,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:25,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:50:25,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:50:25,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:50:25,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:50:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:50:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:50:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:50:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:50:25,760 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 20:50:25,760 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 20:50:25,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:50:25,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:50:25,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:50:25,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:50:25,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:50:25,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:50:25,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:50:25,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:50:25,888 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:50:25,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:50:26,098 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-19 20:50:26,098 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:50:26,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:50:26,116 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 20:50:26,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:50:26 BoogieIcfgContainer [2024-11-19 20:50:26,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:50:26,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:50:26,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:50:26,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:50:26,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:50:25" (1/3) ... [2024-11-19 20:50:26,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1633345d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:50:26, skipping insertion in model container [2024-11-19 20:50:26,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:50:25" (2/3) ... [2024-11-19 20:50:26,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1633345d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:50:26, skipping insertion in model container [2024-11-19 20:50:26,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:50:26" (3/3) ... [2024-11-19 20:50:26,126 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2024-11-19 20:50:26,142 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:50:26,142 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:50:26,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:50:26,208 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;@6a34414a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:50:26,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:50:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:50:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 20:50:26,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:26,222 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] [2024-11-19 20:50:26,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:26,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2024-11-19 20:50:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016889616] [2024-11-19 20:50:26,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:26,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:26,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:50:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:50:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:26,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016889616] [2024-11-19 20:50:26,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016889616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:50:26,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:50:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:50:26,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99403445] [2024-11-19 20:50:26,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:50:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:50:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:26,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:50:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:50:26,741 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:50:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:26,809 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2024-11-19 20:50:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:50:26,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-19 20:50:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:26,818 INFO L225 Difference]: With dead ends: 65 [2024-11-19 20:50:26,819 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 20:50:26,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:50:26,827 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:26,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:50:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 20:50:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 20:50:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:50:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-19 20:50:26,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2024-11-19 20:50:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:26,868 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-19 20:50:26,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:50:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-19 20:50:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 20:50:26,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:26,871 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] [2024-11-19 20:50:26,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:50:26,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:26,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2024-11-19 20:50:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829171442] [2024-11-19 20:50:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:26,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:50:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:50:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829171442] [2024-11-19 20:50:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829171442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:50:27,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:50:27,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:50:27,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877386461] [2024-11-19 20:50:27,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:50:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:50:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:50:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:50:27,120 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:50:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:27,164 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-19 20:50:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:50:27,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-19 20:50:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:27,166 INFO L225 Difference]: With dead ends: 52 [2024-11-19 20:50:27,166 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 20:50:27,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:50:27,168 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:27,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:50:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 20:50:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-19 20:50:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:50:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-19 20:50:27,174 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2024-11-19 20:50:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:27,175 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-19 20:50:27,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:50:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-19 20:50:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 20:50:27,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:27,176 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:27,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:50:27,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:27,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2024-11-19 20:50:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107031250] [2024-11-19 20:50:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:50:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:50:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107031250] [2024-11-19 20:50:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107031250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778929852] [2024-11-19 20:50:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:27,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:27,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:27,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:50:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:27,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 20:50:27,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:27,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:50:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:50:28,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:50:28,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778929852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:50:28,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:50:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-19 20:50:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515229848] [2024-11-19 20:50:28,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 20:50:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 20:50:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 20:50:28,093 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:50:32,107 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-19 20:50:36,133 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-19 20:50:40,156 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-19 20:50:44,171 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-19 20:50:48,350 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-19 20:50:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:48,357 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-19 20:50:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 20:50:48,358 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-11-19 20:50:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:48,359 INFO L225 Difference]: With dead ends: 44 [2024-11-19 20:50:48,359 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:50:48,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-19 20:50:48,360 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:48,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 224 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-19 20:50:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:50:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-19 20:50:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-19 20:50:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-19 20:50:48,367 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 32 [2024-11-19 20:50:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:48,367 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-19 20:50:48,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:50:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-19 20:50:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 20:50:48,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:48,369 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:48,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 20:50:48,569 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-19 20:50:48,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:48,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2024-11-19 20:50:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118126598] [2024-11-19 20:50:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:50:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:50:49,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118126598] [2024-11-19 20:50:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118126598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483317103] [2024-11-19 20:50:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:49,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:49,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:49,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:50:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:49,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-19 20:50:49,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:50,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:50:50,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:50:50,309 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:50:50,309 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-19 20:50:50,378 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 23 treesize of output 11 [2024-11-19 20:50:50,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:50:50,694 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-19 20:50:50,699 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-19 20:50:50,907 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-19 20:50:50,907 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 20 treesize of output 22 [2024-11-19 20:50:50,927 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-19 20:50:51,234 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-19 20:50:51,242 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-19 20:50:51,310 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-19 20:50:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:51,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:53,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 Int) (v_ArrVal_468 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_467)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_468) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-19 20:50:54,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 Int) (v_ArrVal_468 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_467))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_468) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-19 20:50:54,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 Int) (v_ArrVal_468 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_467))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_468) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-19 20:50:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483317103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:55,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:50:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 37 [2024-11-19 20:50:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040216499] [2024-11-19 20:50:55,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:55,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 20:50:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:55,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 20:50:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1537, Unknown=3, NotChecked=240, Total=1892 [2024-11-19 20:50:55,011 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 37 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 29 states have internal predecessors, (53), 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-19 20:50:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:56,298 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-19 20:50:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 20:50:56,298 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 29 states have internal predecessors, (53), 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 35 [2024-11-19 20:50:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:56,299 INFO L225 Difference]: With dead ends: 47 [2024-11-19 20:50:56,299 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:50:56,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=240, Invalid=2849, Unknown=3, NotChecked=330, Total=3422 [2024-11-19 20:50:56,301 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:56,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 378 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 20:50:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:50:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-19 20:50:56,308 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-19 20:50:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-19 20:50:56,309 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 35 [2024-11-19 20:50:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:56,309 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-19 20:50:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 29 states have internal predecessors, (53), 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-19 20:50:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-19 20:50:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:50:56,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:56,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:56,320 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-19 20:50:56,515 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,SelfDestructingSolverStorable3 [2024-11-19 20:50:56,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:56,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2024-11-19 20:50:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838819930] [2024-11-19 20:50:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:50:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:50:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:50:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:50:58,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:58,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838819930] [2024-11-19 20:50:58,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838819930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:58,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877592986] [2024-11-19 20:50:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:58,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:58,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:58,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:50:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:58,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-19 20:50:58,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:58,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:50:58,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:50:58,764 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:50:58,765 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-19 20:50:58,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:50:58,875 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 23 treesize of output 11 [2024-11-19 20:50:58,977 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:50:58,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 20:50:58,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 20:50:59,149 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-19 20:50:59,154 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-19 20:50:59,160 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-19 20:50:59,383 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:50:59,383 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 20 treesize of output 23 [2024-11-19 20:50:59,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:50:59,409 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-19 20:50:59,430 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:50:59,430 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-19 20:50:59,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:50:59,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:50:59,840 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-19 20:50:59,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 19 [2024-11-19 20:51:00,032 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 25 treesize of output 15 [2024-11-19 20:51:00,102 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-19 20:51:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:00,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877592986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:00,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:00,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 45 [2024-11-19 20:51:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826430626] [2024-11-19 20:51:00,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:00,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-19 20:51:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-19 20:51:00,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2625, Unknown=35, NotChecked=0, Total=2862 [2024-11-19 20:51:00,898 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 45 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 36 states have internal predecessors, (57), 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-19 20:51:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:02,525 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-11-19 20:51:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 20:51:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 36 states have internal predecessors, (57), 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 37 [2024-11-19 20:51:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:02,526 INFO L225 Difference]: With dead ends: 69 [2024-11-19 20:51:02,526 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 20:51:02,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=451, Invalid=5519, Unknown=36, NotChecked=0, Total=6006 [2024-11-19 20:51:02,532 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 91 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:02,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 357 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 20:51:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 20:51:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 42. [2024-11-19 20:51:02,545 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-19 20:51:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-19 20:51:02,546 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 37 [2024-11-19 20:51:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:02,546 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-19 20:51:02,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 36 states have internal predecessors, (57), 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-19 20:51:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-19 20:51:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 20:51:02,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:02,550 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:02,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:51:02,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:02,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:02,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2024-11-19 20:51:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994203412] [2024-11-19 20:51:02,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:02,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:03,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:51:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:51:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:51:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994203412] [2024-11-19 20:51:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994203412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461628891] [2024-11-19 20:51:04,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:51:04,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:04,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:04,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:04,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:51:04,591 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:51:04,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:51:04,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 170 conjuncts are in the unsatisfiable core [2024-11-19 20:51:04,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:04,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:51:04,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:04,940 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:51:04,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:51:05,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:05,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:05,046 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 23 treesize of output 11 [2024-11-19 20:51:05,163 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:51:05,164 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2024-11-19 20:51:05,169 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 24 treesize of output 11 [2024-11-19 20:51:05,175 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 27 treesize of output 22 [2024-11-19 20:51:05,317 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 45 treesize of output 21 [2024-11-19 20:51:05,323 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 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-19 20:51:05,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2024-11-19 20:51:05,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:51:05,593 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:51:05,593 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:51:05,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:51:05,604 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 63 treesize of output 39 [2024-11-19 20:51:05,628 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:51:05,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 20:51:05,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-19 20:51:06,286 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:51:06,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:51:06,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:51:06,290 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-19 20:51:06,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 48 [2024-11-19 20:51:06,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:06,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2024-11-19 20:51:06,621 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 27 treesize of output 15 [2024-11-19 20:51:06,625 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-19 20:51:06,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:06,697 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 35 treesize of output 27 [2024-11-19 20:51:06,703 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 20:51:06,703 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 15 treesize of output 7 [2024-11-19 20:51:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:06,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:06,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (or (not (= v_ArrVal_840 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_840 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_840) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_839) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-19 20:51:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461628891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:07,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:07,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27] total 42 [2024-11-19 20:51:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994251404] [2024-11-19 20:51:07,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:07,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-19 20:51:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 20:51:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2484, Unknown=1, NotChecked=100, Total=2756 [2024-11-19 20:51:07,742 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 42 states, 39 states have (on average 1.564102564102564) internal successors, (61), 34 states have internal predecessors, (61), 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-19 20:51:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:09,640 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-11-19 20:51:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 20:51:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.564102564102564) internal successors, (61), 34 states have internal predecessors, (61), 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 39 [2024-11-19 20:51:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:09,642 INFO L225 Difference]: With dead ends: 83 [2024-11-19 20:51:09,644 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 20:51:09,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=359, Invalid=4474, Unknown=1, NotChecked=136, Total=4970 [2024-11-19 20:51:09,646 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:09,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 289 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 20:51:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 20:51:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2024-11-19 20:51:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:51:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-19 20:51:09,665 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 39 [2024-11-19 20:51:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:09,666 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-19 20:51:09,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.564102564102564) internal successors, (61), 34 states have internal predecessors, (61), 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-19 20:51:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-19 20:51:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:51:09,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:09,669 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:09,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:51:09,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:09,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:09,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2024-11-19 20:51:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:09,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440503638] [2024-11-19 20:51:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:51:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:10,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:51:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:51:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:10,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440503638] [2024-11-19 20:51:10,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440503638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:10,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947182626] [2024-11-19 20:51:10,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:10,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:10,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:10,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:10,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:51:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:11,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-19 20:51:11,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:11,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:51:11,174 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:51:11,175 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-19 20:51:11,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:11,247 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:51:11,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 20:51:11,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-19 20:51:11,307 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-19 20:51:11,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:51:11,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-19 20:51:11,405 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-19 20:51:11,406 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 32 treesize of output 34 [2024-11-19 20:51:11,516 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-11-19 20:51:11,517 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2024-11-19 20:51:11,543 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-11-19 20:51:11,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2024-11-19 20:51:11,555 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 22 treesize of output 16 [2024-11-19 20:51:11,605 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 28 treesize of output 20 [2024-11-19 20:51:11,649 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 28 treesize of output 12 [2024-11-19 20:51:11,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:51:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 20:51:11,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947182626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:11,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:11,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2024-11-19 20:51:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66858705] [2024-11-19 20:51:11,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 20:51:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 20:51:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1578, Unknown=24, NotChecked=0, Total=1722 [2024-11-19 20:51:11,997 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 30 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:51:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:12,840 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-11-19 20:51:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 20:51:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 30 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-19 20:51:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:12,842 INFO L225 Difference]: With dead ends: 91 [2024-11-19 20:51:12,842 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 20:51:12,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=308, Invalid=3699, Unknown=25, NotChecked=0, Total=4032 [2024-11-19 20:51:12,845 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 120 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:12,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 272 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:51:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 20:51:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2024-11-19 20:51:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:51:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-19 20:51:12,860 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 40 [2024-11-19 20:51:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:12,860 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-19 20:51:12,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 30 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 20:51:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-19 20:51:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 20:51:12,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:12,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:12,871 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-19 20:51:13,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:13,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:13,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2024-11-19 20:51:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400279897] [2024-11-19 20:51:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:51:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:15,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:51:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:51:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400279897] [2024-11-19 20:51:15,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400279897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328403798] [2024-11-19 20:51:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:15,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:15,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:15,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:15,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:51:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:16,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-11-19 20:51:16,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:16,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:51:16,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:16,446 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:51:16,446 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-19 20:51:16,480 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:51:16,481 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-19 20:51:16,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:51:16,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:16,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:16,666 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:51:16,666 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 88 treesize of output 75 [2024-11-19 20:51:16,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 20:51:16,675 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 39 treesize of output 15 [2024-11-19 20:51:16,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-11-19 20:51:16,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:51:16,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:51:16,821 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-19 20:51:17,074 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:51:17,074 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 20 treesize of output 23 [2024-11-19 20:51:17,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:51:17,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-11-19 20:51:17,100 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-19 20:51:17,100 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-19 20:51:17,130 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:51:17,130 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-19 20:51:17,817 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-19 20:51:17,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 97 [2024-11-19 20:51:17,829 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 83 treesize of output 34 [2024-11-19 20:51:17,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2024-11-19 20:51:17,841 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-19 20:51:17,847 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 35 treesize of output 33 [2024-11-19 20:51:17,968 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 65 treesize of output 41 [2024-11-19 20:51:18,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-19 20:51:18,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:51:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:51:18,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:18,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1208) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1205) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1201) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1202) .cse0) .cse1)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1206) .cse0) .cse1) 4)))) (not (= v_ArrVal_1208 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_1208 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2024-11-19 20:51:18,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (= v_ArrVal_1208 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1208 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1208) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1205) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1201) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1202) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1206) .cse2) .cse3) 4))))))) is different from false [2024-11-19 20:51:18,475 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1208) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1205) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1201) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1202) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1206) .cse1) .cse2) 4)))) (not (= (store (select |c_#memory_int#1| .cse0) .cse3 (select v_ArrVal_1208 .cse3)) v_ArrVal_1208)))))) is different from false [2024-11-19 20:51:18,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5))) (or (not (= (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1208 .cse1)) v_ArrVal_1208)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1208) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1205) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1201) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1202) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1206) .cse2) .cse3) 4)))))))) is different from false [2024-11-19 20:51:18,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1218)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1217) .cse5) .cse6)) (.cse1 (select (select .cse4 .cse5) .cse6))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30|) 0)) (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1216) .cse0) .cse1 (select v_ArrVal_1208 .cse1)) v_ArrVal_1208)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1208) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1205) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1201) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1202) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select .cse4 .cse0) .cse1 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_1206) .cse2) .cse3) 4)))))))) is different from false [2024-11-19 20:51:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328403798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:18,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 49 [2024-11-19 20:51:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382795534] [2024-11-19 20:51:18,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-19 20:51:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-19 20:51:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2507, Unknown=5, NotChecked=520, Total=3192 [2024-11-19 20:51:18,598 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 40 states have internal predecessors, (65), 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-19 20:51:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:20,405 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-11-19 20:51:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 20:51:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 40 states have internal predecessors, (65), 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 41 [2024-11-19 20:51:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:20,407 INFO L225 Difference]: With dead ends: 82 [2024-11-19 20:51:20,407 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 20:51:20,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=305, Invalid=4540, Unknown=5, NotChecked=700, Total=5550 [2024-11-19 20:51:20,409 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:20,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 337 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 20:51:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 20:51:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-19 20:51:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:51:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2024-11-19 20:51:20,425 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 41 [2024-11-19 20:51:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2024-11-19 20:51:20,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 40 states have internal predecessors, (65), 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-19 20:51:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2024-11-19 20:51:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 20:51:20,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:20,427 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:20,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:20,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:20,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2024-11-19 20:51:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313775294] [2024-11-19 20:51:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:51:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:51:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:22,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 20:51:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:22,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:22,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313775294] [2024-11-19 20:51:22,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313775294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:22,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907474159] [2024-11-19 20:51:22,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:22,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:22,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:22,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:51:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:22,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-19 20:51:22,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:22,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 20:51:22,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-19 20:51:22,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-19 20:51:22,918 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 8 treesize of output 1 [2024-11-19 20:51:22,977 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 20:51:22,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-19 20:51:23,765 INFO L349 Elim1Store]: treesize reduction 244, result has 10.6 percent of original size [2024-11-19 20:51:23,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 396 treesize of output 186 [2024-11-19 20:51:23,776 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2024-11-19 20:51:23,777 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 149 [2024-11-19 20:51:23,790 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-19 20:51:23,790 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 143 [2024-11-19 20:51:23,975 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 77 treesize of output 53 [2024-11-19 20:51:24,053 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 20:51:24,053 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 15 treesize of output 7 [2024-11-19 20:51:24,176 INFO L349 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2024-11-19 20:51:24,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 44 [2024-11-19 20:51:24,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:51:24,253 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 32 treesize of output 24 [2024-11-19 20:51:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:51:24,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:46,065 WARN L286 SmtUtils]: Spent 21.08s on a formula simplification. DAG size of input: 1319 DAG size of output: 772 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-19 20:51:46,066 INFO L349 Elim1Store]: treesize reduction 15680, result has 38.1 percent of original size [2024-11-19 20:51:46,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 14 select indices, 14 select index equivalence classes, 1 disjoint index pairs (out of 91 index pairs), introduced 27 new quantified variables, introduced 158 case distinctions, treesize of input 58521 treesize of output 34104