./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:11:22,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:11:22,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:11:22,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:11:22,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:11:22,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:11:22,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:11:22,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:11:22,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:11:22,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:11:22,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:11:22,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:11:22,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:11:22,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:11:22,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:11:22,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:11:22,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:11:22,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:11:22,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:11:22,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:11:22,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:11:22,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:11:22,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:11:22,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:11:22,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:11:22,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:11:22,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:11:22,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:11:22,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:11:22,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:11:22,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:11:22,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:11:22,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:11:22,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:11:22,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:11:22,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:11:22,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:11:22,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:11:22,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:11:22,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:11:22,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:11:22,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 12:11:22,221 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:11:22,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:11:22,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:11:22,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:11:22,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:11:22,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:11:22,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:11:22,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:11:22,224 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:11:22,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:11:22,225 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:11:22,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 12:11:22,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:11:22,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:11:22,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:11:22,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:11:22,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:11:22,226 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:11:22,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:11:22,226 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:11:22,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:11:22,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:11:22,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:11:22,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:11:22,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:11:22,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:11:22,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:11:22,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:11:22,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 12:11:22,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 12:11:22,228 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:11:22,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:11:22,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:11:22,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:11:22,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2021-12-21 12:11:22,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:11:22,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:11:22,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:11:22,440 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:11:22,440 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:11:22,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-12-21 12:11:22,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3472f50ff/f5e8a53c7a4c4da3ad6c2650a2c843cc/FLAG538755b6c [2021-12-21 12:11:22,874 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:11:22,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-12-21 12:11:22,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3472f50ff/f5e8a53c7a4c4da3ad6c2650a2c843cc/FLAG538755b6c [2021-12-21 12:11:23,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3472f50ff/f5e8a53c7a4c4da3ad6c2650a2c843cc [2021-12-21 12:11:23,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:11:23,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:11:23,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:11:23,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:11:23,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:11:23,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7373c611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23, skipping insertion in model container [2021-12-21 12:11:23,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:11:23,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:11:23,579 WARN L230 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_unequal.i[24587,24600] [2021-12-21 12:11:23,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:11:23,591 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:11:23,645 WARN L230 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_unequal.i[24587,24600] [2021-12-21 12:11:23,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:11:23,680 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:11:23,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23 WrapperNode [2021-12-21 12:11:23,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:11:23,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:11:23,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:11:23,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:11:23,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,724 INFO L137 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2021-12-21 12:11:23,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:11:23,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:11:23,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:11:23,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:11:23,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:11:23,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:11:23,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:11:23,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:11:23,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (1/1) ... [2021-12-21 12:11:23,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:11:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:23,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 12:11:23,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 12:11:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 12:11:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 12:11:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 12:11:23,846 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 12:11:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:11:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:11:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 12:11:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:11:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:11:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 12:11:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 12:11:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 12:11:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:11:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:11:23,986 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:11:23,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:11:24,181 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:11:24,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:11:24,191 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-21 12:11:24,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:11:24 BoogieIcfgContainer [2021-12-21 12:11:24,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:11:24,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:11:24,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:11:24,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:11:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:11:23" (1/3) ... [2021-12-21 12:11:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e3c7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:11:24, skipping insertion in model container [2021-12-21 12:11:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:23" (2/3) ... [2021-12-21 12:11:24,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e3c7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:11:24, skipping insertion in model container [2021-12-21 12:11:24,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:11:24" (3/3) ... [2021-12-21 12:11:24,200 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2021-12-21 12:11:24,203 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:11:24,203 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:11:24,246 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:11:24,254 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 12:11:24,254 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:11:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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) [2021-12-21 12:11:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 12:11:24,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:24,278 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:24,279 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2119803949, now seen corresponding path program 1 times [2021-12-21 12:11:24,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:24,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104978200] [2021-12-21 12:11:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:24,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 12:11:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:11:24,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:24,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104978200] [2021-12-21 12:11:24,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104978200] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:24,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:24,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:11:24,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368930144] [2021-12-21 12:11:24,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:24,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:11:24,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:24,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:11:24,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:24,594 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:11:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:24,655 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2021-12-21 12:11:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:11:24,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-21 12:11:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:24,662 INFO L225 Difference]: With dead ends: 71 [2021-12-21 12:11:24,662 INFO L226 Difference]: Without dead ends: 31 [2021-12-21 12:11:24,665 INFO L932 BasicCegarLoop]: 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 [2021-12-21 12:11:24,668 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:24,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-21 12:11:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-21 12:11:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-21 12:11:24,700 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2021-12-21 12:11:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:24,701 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-21 12:11:24,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:11:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-12-21 12:11:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 12:11:24,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:24,704 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:24,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 12:11:24,705 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -826043684, now seen corresponding path program 1 times [2021-12-21 12:11:24,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:24,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913400984] [2021-12-21 12:11:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:24,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 12:11:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:11:24,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:24,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913400984] [2021-12-21 12:11:24,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913400984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:24,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:24,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:11:24,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72918119] [2021-12-21 12:11:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:24,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:11:24,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:11:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:11:24,847 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-21 12:11:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:24,891 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2021-12-21 12:11:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:11:24,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2021-12-21 12:11:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:24,894 INFO L225 Difference]: With dead ends: 58 [2021-12-21 12:11:24,894 INFO L226 Difference]: Without dead ends: 34 [2021-12-21 12:11:24,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:11:24,896 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:24,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-21 12:11:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-21 12:11:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2021-12-21 12:11:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-12-21 12:11:24,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2021-12-21 12:11:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:24,910 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-12-21 12:11:24,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-21 12:11:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-12-21 12:11:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 12:11:24,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:24,912 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:24,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 12:11:24,912 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720012, now seen corresponding path program 1 times [2021-12-21 12:11:24,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:24,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37302171] [2021-12-21 12:11:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:24,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:25,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:25,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:25,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37302171] [2021-12-21 12:11:25,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37302171] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:25,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906394338] [2021-12-21 12:11:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:25,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:25,243 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) [2021-12-21 12:11:25,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 12:11:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:25,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 12:11:25,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:25,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2021-12-21 12:11:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:25,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 12:11:25,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 12:11:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:25,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:25,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (<= (+ .cse0 1) 0) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| |c_#StackHeapBarrier|))))) is different from false [2021-12-21 12:11:25,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906394338] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:25,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:25,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2021-12-21 12:11:25,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201289154] [2021-12-21 12:11:25,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:25,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 12:11:25,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 12:11:25,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2021-12-21 12:11:25,984 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:11:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:26,213 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2021-12-21 12:11:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 12:11:26,214 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2021-12-21 12:11:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:26,216 INFO L225 Difference]: With dead ends: 44 [2021-12-21 12:11:26,216 INFO L226 Difference]: Without dead ends: 33 [2021-12-21 12:11:26,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2021-12-21 12:11:26,217 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:26,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 251 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 166 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-12-21 12:11:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-21 12:11:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-21 12:11:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-21 12:11:26,221 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2021-12-21 12:11:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:26,222 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-21 12:11:26,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:11:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-21 12:11:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 12:11:26,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:26,223 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:26,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 12:11:26,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:26,436 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -158694653, now seen corresponding path program 1 times [2021-12-21 12:11:26,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:26,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598595700] [2021-12-21 12:11:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:26,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:26,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598595700] [2021-12-21 12:11:26,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598595700] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334563838] [2021-12-21 12:11:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:26,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:26,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:26,793 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) [2021-12-21 12:11:26,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 12:11:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 104 conjunts are in the unsatisfiable core [2021-12-21 12:11:26,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:26,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:27,146 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:27,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:27,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:27,276 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:27,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2021-12-21 12:11:27,392 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:27,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 21 [2021-12-21 12:11:27,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-21 12:11:27,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2021-12-21 12:11:27,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,587 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:27,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 50 [2021-12-21 12:11:27,602 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:27,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:27,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2021-12-21 12:11:27,863 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-21 12:11:27,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 85 treesize of output 61 [2021-12-21 12:11:27,882 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-21 12:11:27,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 113 treesize of output 88 [2021-12-21 12:11:27,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,897 INFO L353 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-21 12:11:27,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 92 [2021-12-21 12:11:27,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-12-21 12:11:28,018 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:28,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 24 [2021-12-21 12:11:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:28,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:28,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.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_503))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_504) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2021-12-21 12:11:28,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#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_503))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_504) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2021-12-21 12:11:28,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_503))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_504) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2021-12-21 12:11:28,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| Int)) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_513))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_512))) (let ((.cse0 (store (store .cse4 .cse3 (store (select .cse4 .cse3) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_503))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store .cse2 .cse3 v_ArrVal_504) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 12:11:28,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334563838] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:28,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:28,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 38 [2021-12-21 12:11:28,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85467954] [2021-12-21 12:11:28,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:28,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-21 12:11:28,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-21 12:11:28,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1293, Unknown=6, NotChecked=300, Total=1722 [2021-12-21 12:11:28,128 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 38 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 30 states have internal predecessors, (57), 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) [2021-12-21 12:11:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:28,908 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2021-12-21 12:11:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-21 12:11:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 30 states have internal predecessors, (57), 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 37 [2021-12-21 12:11:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:28,910 INFO L225 Difference]: With dead ends: 84 [2021-12-21 12:11:28,910 INFO L226 Difference]: Without dead ends: 76 [2021-12-21 12:11:28,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=236, Invalid=2324, Unknown=6, NotChecked=404, Total=2970 [2021-12-21 12:11:28,912 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 115 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:28,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 373 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 428 Invalid, 0 Unknown, 27 Unchecked, 0.3s Time] [2021-12-21 12:11:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-21 12:11:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2021-12-21 12:11:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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) [2021-12-21 12:11:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-12-21 12:11:28,919 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-12-21 12:11:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:28,922 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-12-21 12:11:28,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 30 states have internal predecessors, (57), 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) [2021-12-21 12:11:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-12-21 12:11:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 12:11:28,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:28,924 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:28,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:29,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 12:11:29,141 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2134977410, now seen corresponding path program 1 times [2021-12-21 12:11:29,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:29,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801680613] [2021-12-21 12:11:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:29,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:29,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:29,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:11:29,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:29,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801680613] [2021-12-21 12:11:29,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801680613] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:29,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837374317] [2021-12-21 12:11:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:29,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:29,534 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) [2021-12-21 12:11:29,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 12:11:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:29,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 138 conjunts are in the unsatisfiable core [2021-12-21 12:11:29,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:29,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:29,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:30,026 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:30,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:30,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:30,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-12-21 12:11:30,222 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:30,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2021-12-21 12:11:30,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-21 12:11:30,383 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:11:30,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 28 [2021-12-21 12:11:30,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2021-12-21 12:11:30,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:30,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-21 12:11:30,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:30,572 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:30,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 59 [2021-12-21 12:11:30,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:30,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-21 12:11:30,590 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:30,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:30,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:30,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2021-12-21 12:11:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:11:30,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:31,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_711) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_710) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.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_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_709) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2021-12-21 12:11:31,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_720))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_721)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_722) .cse2 v_ArrVal_711) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_710) (select (select (store (store .cse3 .cse2 (store .cse0 .cse1 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse4 .cse2 v_ArrVal_709) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_705) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) is different from false [2021-12-21 12:11:31,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837374317] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:31,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:31,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2021-12-21 12:11:31,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270840558] [2021-12-21 12:11:31,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:31,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-21 12:11:31,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:31,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-21 12:11:31,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1739, Unknown=5, NotChecked=170, Total=2070 [2021-12-21 12:11:31,514 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 36 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 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) [2021-12-21 12:11:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:32,018 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2021-12-21 12:11:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-21 12:11:32,019 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2021-12-21 12:11:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:32,020 INFO L225 Difference]: With dead ends: 79 [2021-12-21 12:11:32,020 INFO L226 Difference]: Without dead ends: 65 [2021-12-21 12:11:32,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=2511, Unknown=5, NotChecked=206, Total=2970 [2021-12-21 12:11:32,021 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:32,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 309 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2021-12-21 12:11:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-21 12:11:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2021-12-21 12:11:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2021-12-21 12:11:32,036 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 39 [2021-12-21 12:11:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:32,037 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2021-12-21 12:11:32,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.625) internal successors, (52), 28 states have internal predecessors, (52), 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) [2021-12-21 12:11:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2021-12-21 12:11:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 12:11:32,041 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:32,041 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:32,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:32,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:32,260 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1887720382, now seen corresponding path program 1 times [2021-12-21 12:11:32,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:32,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319963270] [2021-12-21 12:11:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:32,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:32,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:32,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:32,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319963270] [2021-12-21 12:11:32,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319963270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:32,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481892287] [2021-12-21 12:11:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:32,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:32,952 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) [2021-12-21 12:11:32,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 12:11:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:33,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 115 conjunts are in the unsatisfiable core [2021-12-21 12:11:33,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:33,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:33,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2021-12-21 12:11:33,356 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:33,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:33,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:33,492 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:33,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 36 [2021-12-21 12:11:33,611 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 12:11:33,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 27 [2021-12-21 12:11:33,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:33,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2021-12-21 12:11:33,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:33,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2021-12-21 12:11:33,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:33,767 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:33,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 50 [2021-12-21 12:11:33,780 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:33,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:34,280 INFO L353 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2021-12-21 12:11:34,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 132 treesize of output 74 [2021-12-21 12:11:34,303 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-21 12:11:34,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 95 [2021-12-21 12:11:34,318 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-21 12:11:34,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 118 [2021-12-21 12:11:34,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 68 [2021-12-21 12:11:34,468 INFO L353 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-12-21 12:11:34,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 39 [2021-12-21 12:11:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:34,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:34,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_907 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.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_910))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_912) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-12-21 12:11:34,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| Int) (v_ArrVal_907 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_910))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_912) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11|))))))) is different from false [2021-12-21 12:11:34,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| Int) (v_ArrVal_907 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse4))) (or (not (= .cse0 (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11|))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_910))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse2 .cse3) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_912) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3))))))))) is different from false [2021-12-21 12:11:34,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| Int) (v_ArrVal_907 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse4))) (or (not (= .cse0 (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11|))) (not (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_910))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_912) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))) is different from false [2021-12-21 12:11:34,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| Int) (v_ArrVal_919 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| Int) (v_ArrVal_907 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_920))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_919))) (let ((.cse5 (select (select .cse6 .cse1) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (select .cse6 .cse5))) (or (not (= (select .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11|) .cse1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0)) (not (let ((.cse2 (store (store .cse6 .cse5 (store .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_910))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse2 .cse3) (select (select (store (store .cse4 .cse5 v_ArrVal_912) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| |c_#StackHeapBarrier|)))))))) is different from false [2021-12-21 12:11:34,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481892287] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:34,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:34,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 43 [2021-12-21 12:11:34,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763528959] [2021-12-21 12:11:34,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:34,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-21 12:11:34,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:34,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-21 12:11:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1845, Unknown=6, NotChecked=450, Total=2450 [2021-12-21 12:11:34,739 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:35,374 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2021-12-21 12:11:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-21 12:11:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2021-12-21 12:11:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:35,375 INFO L225 Difference]: With dead ends: 75 [2021-12-21 12:11:35,375 INFO L226 Difference]: Without dead ends: 67 [2021-12-21 12:11:35,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=217, Invalid=2553, Unknown=6, NotChecked=530, Total=3306 [2021-12-21 12:11:35,377 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:35,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 511 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 618 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2021-12-21 12:11:35,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-21 12:11:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2021-12-21 12:11:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 12:11:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2021-12-21 12:11:35,389 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 39 [2021-12-21 12:11:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:35,389 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2021-12-21 12:11:35,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2021-12-21 12:11:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 12:11:35,390 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:35,390 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:35,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-21 12:11:35,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:35,603 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1669816953, now seen corresponding path program 1 times [2021-12-21 12:11:35,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:35,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287549416] [2021-12-21 12:11:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:35,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:36,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:36,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:37,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:37,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287549416] [2021-12-21 12:11:37,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287549416] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:37,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447433715] [2021-12-21 12:11:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:37,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:37,021 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) [2021-12-21 12:11:37,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 12:11:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:37,401 WARN L261 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 202 conjunts are in the unsatisfiable core [2021-12-21 12:11:37,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:37,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:37,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:11:37,705 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:37,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:37,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-12-21 12:11:37,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:37,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2021-12-21 12:11:37,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2021-12-21 12:11:38,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 27 [2021-12-21 12:11:38,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-21 12:11:38,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:38,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:38,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2021-12-21 12:11:38,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:38,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 49 [2021-12-21 12:11:38,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:38,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-21 12:11:38,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:38,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:38,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:38,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 30 [2021-12-21 12:11:38,328 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-21 12:11:38,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-21 12:11:38,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:38,952 INFO L353 Elim1Store]: treesize reduction 208, result has 23.2 percent of original size [2021-12-21 12:11:38,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 496 treesize of output 233 [2021-12-21 12:11:39,023 INFO L353 Elim1Store]: treesize reduction 363, result has 11.2 percent of original size [2021-12-21 12:11:39,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 10 new quantified variables, introduced 11 case distinctions, treesize of input 834 treesize of output 424 [2021-12-21 12:11:39,069 INFO L353 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2021-12-21 12:11:39,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 53 treesize of output 81 [2021-12-21 12:11:39,136 INFO L353 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-12-21 12:11:39,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 341 treesize of output 148 [2021-12-21 12:11:39,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,220 INFO L353 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-12-21 12:11:39,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 337 treesize of output 144 [2021-12-21 12:11:39,364 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:11:39,457 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:11:39,631 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-21 12:11:39,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 304 treesize of output 134 [2021-12-21 12:11:39,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2021-12-21 12:11:39,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-12-21 12:11:39,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:39,987 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-12-21 12:11:39,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 74 [2021-12-21 12:11:52,886 WARN L227 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-21 12:11:55,751 INFO L353 Elim1Store]: treesize reduction 172, result has 56.7 percent of original size [2021-12-21 12:11:55,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 291 treesize of output 393 [2021-12-21 12:11:55,920 INFO L353 Elim1Store]: treesize reduction 140, result has 55.3 percent of original size [2021-12-21 12:11:55,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 407 treesize of output 471 [2021-12-21 12:11:59,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:59,088 INFO L328 TraceCheckSpWp]: Computing backward predicates...