./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 61a67961 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.fs.cvc5-61a6796-m [2024-10-14 01:53:21,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:53:21,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:53:21,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:53:21,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:53:21,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:53:21,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:53:21,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:53:21,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:53:21,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:53:21,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:53:21,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:53:21,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:53:21,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:53:21,776 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:53:21,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:53:21,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:53:21,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:53:21,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:53:21,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:53:21,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:53:21,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:53:21,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:53:21,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:53:21,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:53:21,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:53:21,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:53:21,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:53:21,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:53:21,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:53:21,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:53:21,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:53:21,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:53:21,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:53:21,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:53:21,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:53:21,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:53:21,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:53:21,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:53:21,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:53:21,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:53:21,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:53:21,786 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-10-14 01:53:22,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:53:22,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:53:22,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:53:22,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:53:22,075 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:53:22,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-10-14 01:53:23,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:53:23,695 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:53:23,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2024-10-14 01:53:23,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b7324ce/7a62ec0fae6f46e0b3b3a307b6bebe5e/FLAG42084d117 [2024-10-14 01:53:23,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b7324ce/7a62ec0fae6f46e0b3b3a307b6bebe5e [2024-10-14 01:53:23,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:53:23,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:53:23,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:53:23,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:53:23,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:53:23,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:53:23" (1/1) ... [2024-10-14 01:53:23,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ab522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:23, skipping insertion in model container [2024-10-14 01:53:23,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:53:23" (1/1) ... [2024-10-14 01:53:23,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:53:24,076 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2024-10-14 01:53:24,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:53:24,088 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:53:24,150 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2024-10-14 01:53:24,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:53:24,199 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:53:24,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24 WrapperNode [2024-10-14 01:53:24,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:53:24,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:53:24,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:53:24,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:53:24,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,247 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2024-10-14 01:53:24,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:53:24,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:53:24,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:53:24,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:53:24,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,288 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-10-14 01:53:24,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:53:24,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:53:24,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:53:24,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:53:24,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (1/1) ... [2024-10-14 01:53:24,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:53:24,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:24,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:53:24,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:53:24,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:53:24,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 01:53:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:53:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 01:53:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 01:53:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 01:53:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:53:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:53:24,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:53:24,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:53:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:53:24,515 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:53:24,517 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:53:24,703 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-14 01:53:24,704 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:53:24,750 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:53:24,753 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 01:53:24,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:24 BoogieIcfgContainer [2024-10-14 01:53:24,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:53:24,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:53:24,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:53:24,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:53:24,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:53:23" (1/3) ... [2024-10-14 01:53:24,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124e3ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:53:24, skipping insertion in model container [2024-10-14 01:53:24,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:53:24" (2/3) ... [2024-10-14 01:53:24,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124e3ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:53:24, skipping insertion in model container [2024-10-14 01:53:24,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:53:24" (3/3) ... [2024-10-14 01:53:24,762 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2024-10-14 01:53:24,779 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:53:24,779 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:53:24,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:53:24,829 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;@5199f82b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:53:24,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:53:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:53:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 01:53:24,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:24,844 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:24,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:24,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2024-10-14 01:53:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:24,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152769840] [2024-10-14 01:53:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:53:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:53:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:25,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152769840] [2024-10-14 01:53:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152769840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:53:25,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:53:25,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:53:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141538985] [2024-10-14 01:53:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:53:25,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:53:25,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:25,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:53:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:53:25,256 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:53:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:25,324 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2024-10-14 01:53:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:53:25,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2024-10-14 01:53:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:25,333 INFO L225 Difference]: With dead ends: 54 [2024-10-14 01:53:25,333 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 01:53:25,336 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-10-14 01:53:25,339 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:25,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:53:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 01:53:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-14 01:53:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:53:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-14 01:53:25,374 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2024-10-14 01:53:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:25,376 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-14 01:53:25,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:53:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-14 01:53:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 01:53:25,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:25,378 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:25,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:53:25,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:25,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2024-10-14 01:53:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904819606] [2024-10-14 01:53:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:25,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:53:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:53:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904819606] [2024-10-14 01:53:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904819606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:53:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:53:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:53:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868710197] [2024-10-14 01:53:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:53:25,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:53:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:25,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:53:25,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:53:25,592 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:53:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:25,641 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-10-14 01:53:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:53:25,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2024-10-14 01:53:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:25,644 INFO L225 Difference]: With dead ends: 43 [2024-10-14 01:53:25,644 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 01:53:25,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:53:25,646 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:25,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:53:25,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 01:53:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-14 01:53:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:53:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-14 01:53:25,658 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2024-10-14 01:53:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-14 01:53:25,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 01:53:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-14 01:53:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 01:53:25,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:25,661 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:25,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:53:25,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2024-10-14 01:53:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313978766] [2024-10-14 01:53:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:53:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:53:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:53:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:53:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313978766] [2024-10-14 01:53:26,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313978766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869239779] [2024-10-14 01:53:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:26,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:26,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:26,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:26,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:53:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:26,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 01:53:26,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:26,461 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-10-14 01:53:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:53:26,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 01:53:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869239779] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:53:26,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:53:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 12 [2024-10-14 01:53:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431843618] [2024-10-14 01:53:26,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:26,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 01:53:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 01:53:26,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-14 01:53:26,547 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-10-14 01:53:30,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:53:34,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:53:38,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:53:42,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:53:46,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:53:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:46,793 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-10-14 01:53:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 01:53:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 24 [2024-10-14 01:53:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:46,795 INFO L225 Difference]: With dead ends: 36 [2024-10-14 01:53:46,795 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 01:53:46,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-14 01:53:46,796 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:46,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 153 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-10-14 01:53:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 01:53:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-14 01:53:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:53:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-14 01:53:46,807 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2024-10-14 01:53:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:46,808 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-14 01:53:46,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-10-14 01:53:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-14 01:53:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 01:53:46,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:46,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:46,828 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-10-14 01:53:47,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:47,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2024-10-14 01:53:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692488189] [2024-10-14 01:53:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:53:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:53:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:53:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692488189] [2024-10-14 01:53:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692488189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088048224] [2024-10-14 01:53:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:48,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:48,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:48,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:53:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:48,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-14 01:53:48,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:48,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:53:48,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:53:48,843 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:53:48,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:53:48,914 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-10-14 01:53:49,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-14 01:53:49,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:53:49,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 01:53:49,293 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-14 01:53:49,294 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-10-14 01:53:49,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-14 01:53:49,642 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-10-14 01:53:49,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-14 01:53:49,718 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-10-14 01:53:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:53:49,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:49,957 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (or (= |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_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))) (not (= v_ArrVal_467 (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_467 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2024-10-14 01:53:49,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (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|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 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))) (not (= v_ArrVal_467 (let ((.cse1 (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|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_467 .cse1)))))))) is different from false [2024-10-14 01:53:49,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (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|))) (or (not (= v_ArrVal_467 (let ((.cse1 (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|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_467 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 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-10-14 01:53:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088048224] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:50,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:53:50,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 35 [2024-10-14 01:53:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115930193] [2024-10-14 01:53:50,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:50,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 01:53:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 01:53:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1383, Unknown=3, NotChecked=228, Total=1722 [2024-10-14 01:53:50,124 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 35 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:51,193 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-14 01:53:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 01:53:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 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 27 [2024-10-14 01:53:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:51,198 INFO L225 Difference]: With dead ends: 39 [2024-10-14 01:53:51,198 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 01:53:51,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=2534, Unknown=3, NotChecked=312, Total=3080 [2024-10-14 01:53:51,200 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:51,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 258 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:53:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 01:53:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-10-14 01:53:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 01:53:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-14 01:53:51,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 27 [2024-10-14 01:53:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:51,208 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-14 01:53:51,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-14 01:53:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 01:53:51,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:51,209 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:53:51,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 01:53:51,410 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-10-14 01:53:51,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:51,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2024-10-14 01:53:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:51,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758521602] [2024-10-14 01:53:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:53:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:53:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:53:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:53,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758521602] [2024-10-14 01:53:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758521602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722046402] [2024-10-14 01:53:53,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:53,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:53,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:53,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:53:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:53,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-10-14 01:53:53,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:53,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:53:53,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:53:53,679 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:53:53,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:53:53,739 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-10-14 01:53:53,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:53:53,853 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 01:53:53,853 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 78 treesize of output 53 [2024-10-14 01:53:53,868 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 36 treesize of output 15 [2024-10-14 01:53:53,937 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-10-14 01:53:53,942 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-10-14 01:53:53,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:53:54,123 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:53:54,123 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-10-14 01:53:54,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:54,148 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-10-14 01:53:54,168 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:53:54,168 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-10-14 01:53:54,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:53:54,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:53:54,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2024-10-14 01:53:54,715 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-10-14 01:53:54,798 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-10-14 01:53:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:53:54,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:55,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722046402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:55,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:53:55,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 46 [2024-10-14 01:53:55,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925604341] [2024-10-14 01:53:55,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:55,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-14 01:53:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:55,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-14 01:53:55,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2513, Unknown=64, NotChecked=0, Total=2756 [2024-10-14 01:53:55,371 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 46 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:53:57,217 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-10-14 01:53:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 01:53:57,217 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-10-14 01:53:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:53:57,219 INFO L225 Difference]: With dead ends: 59 [2024-10-14 01:53:57,219 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 01:53:57,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=453, Invalid=5644, Unknown=65, NotChecked=0, Total=6162 [2024-10-14 01:53:57,222 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 107 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 01:53:57,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 247 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 01:53:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 01:53:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2024-10-14 01:53:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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-10-14 01:53:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-14 01:53:57,230 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2024-10-14 01:53:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:53:57,231 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-14 01:53:57,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:53:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-14 01:53:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:53:57,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:53:57,232 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 01:53:57,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 01:53:57,432 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-10-14 01:53:57,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:53:57,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:53:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2024-10-14 01:53:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:53:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768865076] [2024-10-14 01:53:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:53:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:53:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:53:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:53:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:53:58,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:53:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768865076] [2024-10-14 01:53:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768865076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925593187] [2024-10-14 01:53:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:53:58,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:53:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:53:58,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:53:58,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 01:53:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:53:59,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 01:53:59,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:53:59,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:53:59,282 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:53:59,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:53:59,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:53:59,378 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-14 01:53:59,378 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 70 treesize of output 57 [2024-10-14 01:53:59,416 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-10-14 01:53:59,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:53:59,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:53:59,530 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-10-14 01:53:59,544 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-14 01:53:59,544 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-10-14 01:53:59,662 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-14 01:53:59,662 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-10-14 01:53:59,680 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-10-14 01:53:59,680 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-10-14 01:53:59,690 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-10-14 01:53:59,704 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-10-14 01:53:59,739 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 35 treesize of output 19 [2024-10-14 01:53:59,741 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-10-14 01:53:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:53:59,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:53:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925593187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:53:59,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:53:59,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 38 [2024-10-14 01:53:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499615993] [2024-10-14 01:53:59,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:53:59,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-14 01:53:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:53:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-14 01:53:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1502, Unknown=24, NotChecked=0, Total=1640 [2024-10-14 01:53:59,974 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 38 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 01:54:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:00,852 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2024-10-14 01:54:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 01:54:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2024-10-14 01:54:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:00,855 INFO L225 Difference]: With dead ends: 77 [2024-10-14 01:54:00,855 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 01:54:00,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=228, Invalid=2718, Unknown=24, NotChecked=0, Total=2970 [2024-10-14 01:54:00,857 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:00,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 290 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:54:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 01:54:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2024-10-14 01:54:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 01:54:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-10-14 01:54:00,870 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 31 [2024-10-14 01:54:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:00,870 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-10-14 01:54:00,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 01:54:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-10-14 01:54:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 01:54:00,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:00,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:00,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:54:01,072 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-10-14 01:54:01,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2024-10-14 01:54:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594631004] [2024-10-14 01:54:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:02,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:54:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594631004] [2024-10-14 01:54:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594631004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169900608] [2024-10-14 01:54:02,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:54:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:02,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:02,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 01:54:02,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:54:02,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:54:02,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-10-14 01:54:02,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:02,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:02,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:02,919 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:54:02,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:54:02,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:02,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:02,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 01:54:03,077 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 01:54:03,077 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 105 treesize of output 68 [2024-10-14 01:54:03,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-14 01:54:03,097 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 36 treesize of output 15 [2024-10-14 01:54:03,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-14 01:54:03,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:54:03,180 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 19 treesize of output 7 [2024-10-14 01:54:03,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 01:54:03,345 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:54:03,345 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-10-14 01:54:03,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:03,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-10-14 01:54:03,373 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:54:03,373 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-10-14 01:54:03,381 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 45 treesize of output 40 [2024-10-14 01:54:03,730 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:54:03,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:54:03,731 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 23 [2024-10-14 01:54:04,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:04,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:54:04,043 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:54:04,076 INFO L349 Elim1Store]: treesize reduction 33, result has 49.2 percent of original size [2024-10-14 01:54:04,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 50 [2024-10-14 01:54:04,327 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2024-10-14 01:54:04,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2024-10-14 01:54:04,333 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 12 treesize of output 1 [2024-10-14 01:54:04,340 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 26 treesize of output 15 [2024-10-14 01:54:04,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-10-14 01:54:04,395 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-10-14 01:54:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:04,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:04,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (or (not (= (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_1010 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) v_ArrVal_1010)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1010) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1011) (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)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2024-10-14 01:54:04,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| Int) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse0 (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 (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .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|))) (not (= (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .cse0 (select v_ArrVal_1010 .cse0)) v_ArrVal_1010)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| v_ArrVal_1010) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1011) (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-10-14 01:54:04,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| Int) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| (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|)) (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 (= (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .cse0 (select v_ArrVal_1010 .cse0)) v_ArrVal_1010)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .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|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| v_ArrVal_1010) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1011) (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-10-14 01:54:04,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| Int) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse1 (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 (let ((.cse2 (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|))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse1)) (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse1))))) (or (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .cse0) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| v_ArrVal_1010) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1011) (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))) (not (= v_ArrVal_1010 (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .cse0 (select v_ArrVal_1010 .cse0)))))))) is different from false [2024-10-14 01:54:04,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| Int) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse1 (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 (let ((.cse2 (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|))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse1)) (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse1))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29| v_ArrVal_1010) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1011) (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))) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .cse0) .cse1)) (not (= v_ArrVal_1010 (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_29|) .cse0 (select v_ArrVal_1010 .cse0)))))))) is different from false [2024-10-14 01:54:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169900608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:05,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:54:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 40 [2024-10-14 01:54:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485287016] [2024-10-14 01:54:05,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:05,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-14 01:54:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-14 01:54:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1926, Unknown=5, NotChecked=460, Total=2550 [2024-10-14 01:54:05,044 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 40 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:54:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:06,791 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2024-10-14 01:54:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 01:54:06,792 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 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 31 [2024-10-14 01:54:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:06,793 INFO L225 Difference]: With dead ends: 75 [2024-10-14 01:54:06,793 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 01:54:06,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=328, Invalid=3593, Unknown=5, NotChecked=630, Total=4556 [2024-10-14 01:54:06,795 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:06,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 279 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 01:54:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 01:54:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-10-14 01:54:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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-10-14 01:54:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-10-14 01:54:06,811 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 31 [2024-10-14 01:54:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:06,812 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-10-14 01:54:06,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:54:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-10-14 01:54:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 01:54:06,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:06,813 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 01:54:06,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 01:54:07,013 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-10-14 01:54:07,014 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:07,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2024-10-14 01:54:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535064137] [2024-10-14 01:54:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:07,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:54:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535064137] [2024-10-14 01:54:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535064137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808886483] [2024-10-14 01:54:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:09,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:09,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 01:54:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:09,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-10-14 01:54:09,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:09,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:09,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:10,228 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:54:10,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 01:54:10,261 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:54:10,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:54:10,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:10,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:54:10,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:10,438 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 01:54:10,439 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 132 treesize of output 83 [2024-10-14 01:54:10,447 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 36 treesize of output 15 [2024-10-14 01:54:10,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:10,452 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 55 treesize of output 19 [2024-10-14 01:54:10,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-14 01:54:10,514 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-10-14 01:54:10,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:54:10,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:54:10,710 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:54:10,711 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-10-14 01:54:10,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:10,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2024-10-14 01:54:10,738 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-14 01:54:10,739 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-10-14 01:54:10,764 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:54:10,764 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-10-14 01:54:11,503 INFO L349 Elim1Store]: treesize reduction 68, result has 11.7 percent of original size [2024-10-14 01:54:11,503 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 4 case distinctions, treesize of input 156 treesize of output 89 [2024-10-14 01:54:11,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-14 01:54:11,511 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 48 treesize of output 42 [2024-10-14 01:54:11,517 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-10-14 01:54:11,521 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-10-14 01:54:11,527 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 24 treesize of output 19 [2024-10-14 01:54:11,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-10-14 01:54:11,701 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-10-14 01:54:11,703 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-10-14 01:54:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:11,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:11,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1205 Int) (v_ArrVal_1209 (Array Int Int))) (= |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| (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_1205)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1208) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1209) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1210) .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_1203) .cse0) .cse1) 4))))) is different from false [2024-10-14 01:54:12,455 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1203 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int) (v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1205 Int) (v_ArrVal_1209 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1220)) (.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1219)) (.cse6 (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|)) (.cse7 (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 .cse5 .cse6) .cse7)) (.cse1 (select (select .cse4 .cse6) .cse7))) (or (= |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 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1218) .cse0) .cse1 v_ArrVal_1205)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1208) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1209) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1210) .cse2) .cse3)) (+ 4 (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_32| v_ArrVal_1203) .cse2) .cse3))))) (not (= (select (select .cse5 .cse0) .cse1) .cse6)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))) is different from false [2024-10-14 01:54:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808886483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:12,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:54:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2024-10-14 01:54:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865297854] [2024-10-14 01:54:12,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-14 01:54:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-14 01:54:12,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2794, Unknown=4, NotChecked=214, Total=3192 [2024-10-14 01:54:12,461 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:54:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:14,277 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-10-14 01:54:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 01:54:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 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 32 [2024-10-14 01:54:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:14,278 INFO L225 Difference]: With dead ends: 66 [2024-10-14 01:54:14,278 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 01:54:14,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=360, Invalid=5046, Unknown=4, NotChecked=290, Total=5700 [2024-10-14 01:54:14,280 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:14,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 224 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 01:54:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 01:54:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2024-10-14 01:54:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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-10-14 01:54:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-10-14 01:54:14,294 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 32 [2024-10-14 01:54:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:14,294 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-10-14 01:54:14,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 01:54:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-10-14 01:54:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:54:14,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:14,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-14 01:54:14,310 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-10-14 01:54:14,496 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-10-14 01:54:14,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1638621109, now seen corresponding path program 1 times [2024-10-14 01:54:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361450713] [2024-10-14 01:54:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:16,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:54:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:16,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361450713] [2024-10-14 01:54:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361450713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919727427] [2024-10-14 01:54:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:16,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:16,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:16,425 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:16,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 01:54:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:16,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-10-14 01:54:16,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:16,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:16,921 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:54:16,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:54:16,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:16,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:17,102 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-14 01:54:17,103 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 78 treesize of output 53 [2024-10-14 01:54:17,109 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 36 treesize of output 15 [2024-10-14 01:54:17,163 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-10-14 01:54:17,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:54:17,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 01:54:17,373 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 01:54:17,374 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-10-14 01:54:17,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:17,389 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-10-14 01:54:17,405 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:54:17,405 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-10-14 01:54:17,967 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-14 01:54:17,967 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 105 treesize of output 62 [2024-10-14 01:54:17,982 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-10-14 01:54:17,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 92 [2024-10-14 01:54:17,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:17,991 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 80 treesize of output 20 [2024-10-14 01:54:18,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-14 01:54:18,175 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:54:18,176 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-10-14 01:54:18,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2024-10-14 01:54:18,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:54:18,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2024-10-14 01:54:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:54:18,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:54:18,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (not (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|))) (= (let ((.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 (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (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| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1397))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1396) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1395) .cse1) .cse2))) .cse1)))) is different from false [2024-10-14 01:54:18,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1403)) (.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1404)) (.cse8 (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|)) (.cse7 (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 ((.cse3 (select (select .cse4 .cse8) .cse7)) (.cse5 (select (select .cse6 .cse8) .cse7))) (or (not (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|))) (= (let ((.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 (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select .cse4 .cse3) .cse5 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1397))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1396) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1395) .cse1) .cse2))) .cse1))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)) (not (= (select (select .cse6 .cse3) .cse5) .cse7)))))) is different from false [2024-10-14 01:54:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919727427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:18,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:54:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 42 [2024-10-14 01:54:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718102382] [2024-10-14 01:54:18,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:54:18,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-14 01:54:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:54:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-14 01:54:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2010, Unknown=2, NotChecked=182, Total=2352 [2024-10-14 01:54:18,740 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 42 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 01:54:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:54:20,409 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2024-10-14 01:54:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-14 01:54:20,410 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-14 01:54:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:54:20,411 INFO L225 Difference]: With dead ends: 79 [2024-10-14 01:54:20,411 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 01:54:20,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=408, Invalid=5148, Unknown=2, NotChecked=294, Total=5852 [2024-10-14 01:54:20,413 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 103 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 01:54:20,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 288 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 01:54:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 01:54:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2024-10-14 01:54:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-10-14 01:54:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-10-14 01:54:20,429 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 34 [2024-10-14 01:54:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:54:20,429 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-10-14 01:54:20,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 01:54:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-10-14 01:54:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 01:54:20,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:54:20,430 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:54:20,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 01:54:20,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:20,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:54:20,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:54:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash -742312008, now seen corresponding path program 2 times [2024-10-14 01:54:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:54:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454185311] [2024-10-14 01:54:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:54:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:54:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:54:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:22,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 01:54:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 01:54:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:54:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:54:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:54:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454185311] [2024-10-14 01:54:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454185311] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:54:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949405041] [2024-10-14 01:54:22,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:54:22,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:54:22,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:54:22,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:54:22,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 01:54:22,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:54:22,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:54:22,786 WARN L253 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 187 conjuncts are in the unsatisfiable core [2024-10-14 01:54:22,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:54:22,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 01:54:22,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:23,083 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:54:23,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-14 01:54:23,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:54:23,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:54:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:23,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:54:23,242 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-14 01:54:23,243 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 142 treesize of output 72 [2024-10-14 01:54:23,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-14 01:54:23,256 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 55 treesize of output 19 [2024-10-14 01:54:23,326 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 01:54:23,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2024-10-14 01:54:23,336 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 19 treesize of output 7 [2024-10-14 01:54:23,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:54:23,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:54:23,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-14 01:54:23,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:54:23,565 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 01:54:23,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 64 [2024-10-14 01:54:23,586 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-14 01:54:23,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-10-14 01:54:23,609 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:54:23,610 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-10-14 01:54:23,617 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 24 treesize of output 19 [2024-10-14 01:54:24,715 INFO L349 Elim1Store]: treesize reduction 232, result has 11.5 percent of original size [2024-10-14 01:54:24,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 175 treesize of output 142 [2024-10-14 01:54:24,763 INFO L349 Elim1Store]: treesize reduction 208, result has 10.0 percent of original size [2024-10-14 01:54:24,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 124 treesize of output 128 [2024-10-14 01:54:24,775 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 36 treesize of output 36 [2024-10-14 01:54:24,785 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 12 treesize of output 1 [2024-10-14 01:54:25,085 INFO L349 Elim1Store]: treesize reduction 352, result has 34.3 percent of original size [2024-10-14 01:54:25,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 267 [2024-10-14 01:54:25,239 INFO L349 Elim1Store]: treesize reduction 367, result has 29.8 percent of original size [2024-10-14 01:54:25,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 219 treesize of output 265 [2024-10-14 01:54:25,289 INFO L349 Elim1Store]: treesize reduction 79, result has 31.3 percent of original size [2024-10-14 01:54:25,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 131 [2024-10-14 01:54:25,307 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 26 treesize of output 34 [2024-10-14 01:54:26,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:54:26,346 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 20 treesize of output 1 [2024-10-14 01:54:26,429 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 63 treesize of output 33 [2024-10-14 01:54:26,435 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 19 treesize of output 15