./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 f4b24e32 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-?-f4b24e3 [2022-07-13 15:15:49,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:15:49,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:15:49,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:15:49,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:15:49,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:15:49,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:15:49,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:15:49,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:15:49,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:15:49,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:15:49,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:15:49,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:15:49,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:15:49,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:15:49,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:15:49,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:15:49,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:15:49,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:15:49,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:15:49,306 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:15:49,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:15:49,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:15:49,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:15:49,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:15:49,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:15:49,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:15:49,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:15:49,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:15:49,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:15:49,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:15:49,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:15:49,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:15:49,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:15:49,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:15:49,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:15:49,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:15:49,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:15:49,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:15:49,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:15:49,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:15:49,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:15:49,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:15:49,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:15:49,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:15:49,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:15:49,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:15:49,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:15:49,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:15:49,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:15:49,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:15:49,360 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:15:49,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:15:49,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:15:49,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:15:49,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:15:49,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:15:49,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:15:49,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:15:49,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:15:49,362 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:15:49,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:15:49,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:15:49,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:15:49,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:15:49,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:15:49,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:15:49,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:15:49,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:15:49,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:15:49,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:15:49,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:15:49,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:15:49,364 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:15:49,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:15:49,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:15:49,365 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 [2022-07-13 15:15:49,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:15:49,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:15:49,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:15:49,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:15:49,639 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:15:49,640 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 [2022-07-13 15:15:49,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5637cfe69/400d3f5d0cf34155b95cd90e1d32f395/FLAG975ba0167 [2022-07-13 15:15:50,187 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:15:50,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-07-13 15:15:50,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5637cfe69/400d3f5d0cf34155b95cd90e1d32f395/FLAG975ba0167 [2022-07-13 15:15:50,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5637cfe69/400d3f5d0cf34155b95cd90e1d32f395 [2022-07-13 15:15:50,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:15:50,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:15:50,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:15:50,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:15:50,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:15:50,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:15:50" (1/1) ... [2022-07-13 15:15:50,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f29d604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:50, skipping insertion in model container [2022-07-13 15:15:50,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:15:50" (1/1) ... [2022-07-13 15:15:50,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:15:50,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:15:50,975 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] [2022-07-13 15:15:50,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:15:50,989 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:15:51,031 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] [2022-07-13 15:15:51,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:15:51,057 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:15:51,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51 WrapperNode [2022-07-13 15:15:51,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:15:51,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:15:51,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:15:51,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:15:51,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,104 INFO L137 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2022-07-13 15:15:51,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:15:51,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:15:51,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:15:51,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:15:51,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:15:51,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:15:51,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:15:51,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:15:51,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (1/1) ... [2022-07-13 15:15:51,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:15:51,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:15:51,196 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) [2022-07-13 15:15:51,198 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 [2022-07-13 15:15:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:15:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:15:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:15:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:15:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:15:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:15:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:15:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:15:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:15:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:15:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:15:51,368 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:15:51,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:15:51,587 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:15:51,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:15:51,593 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 15:15:51,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:15:51 BoogieIcfgContainer [2022-07-13 15:15:51,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:15:51,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:15:51,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:15:51,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:15:51,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:15:50" (1/3) ... [2022-07-13 15:15:51,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd24945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:15:51, skipping insertion in model container [2022-07-13 15:15:51,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:15:51" (2/3) ... [2022-07-13 15:15:51,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd24945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:15:51, skipping insertion in model container [2022-07-13 15:15:51,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:15:51" (3/3) ... [2022-07-13 15:15:51,601 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-07-13 15:15:51,615 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:15:51,616 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:15:51,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:15:51,678 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2348ecd8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f236af2 [2022-07-13 15:15:51,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:15:51,689 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) [2022-07-13 15:15:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:15:51,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:51,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:51,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2119803949, now seen corresponding path program 1 times [2022-07-13 15:15:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:15:51,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893959034] [2022-07-13 15:15:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:15:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:15:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:15:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:15:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:15:51,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893959034] [2022-07-13 15:15:51,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893959034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:15:51,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:15:51,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:15:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227354352] [2022-07-13 15:15:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:15:52,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:15:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:15:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:15:52,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:15:52,043 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) [2022-07-13 15:15:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:52,128 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2022-07-13 15:15:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:15:52,131 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 [2022-07-13 15:15:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:52,137 INFO L225 Difference]: With dead ends: 71 [2022-07-13 15:15:52,137 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:15:52,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:15:52,142 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:15:52,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:15:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:15:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 15:15:52,177 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) [2022-07-13 15:15:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 15:15:52,180 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2022-07-13 15:15:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:52,181 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 15:15:52,181 INFO L496 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) [2022-07-13 15:15:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 15:15:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:15:52,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:52,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:52,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:15:52,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash -826043684, now seen corresponding path program 1 times [2022-07-13 15:15:52,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:15:52,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412536] [2022-07-13 15:15:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:15:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:15:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:15:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:15:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:15:52,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412536] [2022-07-13 15:15:52,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:15:52,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:15:52,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:15:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014249468] [2022-07-13 15:15:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:15:52,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:15:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:15:52,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:15:52,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:15:52,348 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) [2022-07-13 15:15:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:52,394 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-07-13 15:15:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:15:52,395 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 [2022-07-13 15:15:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:52,396 INFO L225 Difference]: With dead ends: 58 [2022-07-13 15:15:52,396 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:15:52,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:15:52,398 INFO L413 NwaCegarLoop]: 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 [2022-07-13 15:15:52,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:15:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:15:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-13 15:15:52,409 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) [2022-07-13 15:15:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-07-13 15:15:52,410 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2022-07-13 15:15:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:52,410 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-13 15:15:52,410 INFO L496 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) [2022-07-13 15:15:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-07-13 15:15:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 15:15:52,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:52,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:52,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:15:52,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720012, now seen corresponding path program 1 times [2022-07-13 15:15:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:15:52,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192986177] [2022-07-13 15:15:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:15:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:15:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:15:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:15:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:15:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:15:52,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192986177] [2022-07-13 15:15:52,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192986177] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:52,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854774435] [2022-07-13 15:15:52,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:52,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:15:52,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:15:52,820 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) [2022-07-13 15:15:52,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:15:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:52,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 15:15:52,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:53,288 INFO L390 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 9 treesize of output 5 [2022-07-13 15:15:53,291 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 15:15:53,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:53,388 INFO L390 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 [2022-07-13 15:15:53,425 INFO L390 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 [2022-07-13 15:15:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:15:53,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:53,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_8| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_8| v_ArrVal_316) |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_8| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0) (<= 1 .cse0)))) is different from false [2022-07-13 15:15:53,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854774435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:53,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:15:53,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-07-13 15:15:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71375557] [2022-07-13 15:15:53,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:15:53,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:15:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:15:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:15:53,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-07-13 15:15:53,541 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) [2022-07-13 15:15:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:53,819 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-07-13 15:15:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:15:53,821 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 [2022-07-13 15:15:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:53,823 INFO L225 Difference]: With dead ends: 44 [2022-07-13 15:15:53,823 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 15:15:53,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2022-07-13 15:15:53,825 INFO L413 NwaCegarLoop]: 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 [2022-07-13 15:15:53,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 251 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 166 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-13 15:15:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 15:15:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-13 15:15:53,839 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) [2022-07-13 15:15:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-13 15:15:53,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2022-07-13 15:15:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:53,840 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-13 15:15:53,841 INFO L496 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) [2022-07-13 15:15:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-13 15:15:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:15:53,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:53,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:53,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:15:54,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:15:54,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash -158694653, now seen corresponding path program 1 times [2022-07-13 15:15:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:15:54,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715088505] [2022-07-13 15:15:54,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:15:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:15:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:15:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:15:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:15:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:15:54,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715088505] [2022-07-13 15:15:54,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715088505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:54,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123192644] [2022-07-13 15:15:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:54,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:15:54,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:15:54,492 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) [2022-07-13 15:15:54,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:15:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:54,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-13 15:15:54,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:54,691 INFO L390 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 [2022-07-13 15:15:54,956 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:15:54,956 INFO L390 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 [2022-07-13 15:15:55,029 INFO L390 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 [2022-07-13 15:15:55,118 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:55,119 INFO L390 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 [2022-07-13 15:15:55,249 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:15:55,249 INFO L390 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 [2022-07-13 15:15:55,260 INFO L390 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 [2022-07-13 15:15:55,267 INFO L390 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 [2022-07-13 15:15:55,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:55,456 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:55,457 INFO L390 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 [2022-07-13 15:15:55,475 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:15:55,476 INFO L390 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 [2022-07-13 15:15:55,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:55,497 INFO L390 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 [2022-07-13 15:15:55,740 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:15:55,741 INFO L390 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 [2022-07-13 15:15:55,767 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-13 15:15:55,768 INFO L390 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 [2022-07-13 15:15:55,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:55,790 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-13 15:15:55,790 INFO L390 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 [2022-07-13 15:15:55,837 INFO L390 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 [2022-07-13 15:15:55,894 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:15:55,894 INFO L390 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 [2022-07-13 15:15:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:15:55,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:55,914 WARN L833 $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 [2022-07-13 15:15:55,931 WARN L833 $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 [2022-07-13 15:15:55,939 WARN L833 $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 [2022-07-13 15:15:56,012 WARN L833 $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_11| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11|) 0)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| 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_11| 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_11|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| 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_11| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-07-13 15:15:56,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123192644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:56,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:15:56,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 38 [2022-07-13 15:15:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747498668] [2022-07-13 15:15:56,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:15:56,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 15:15:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:15:56,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 15:15:56,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1293, Unknown=6, NotChecked=300, Total=1722 [2022-07-13 15:15:56,018 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) [2022-07-13 15:15:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:56,833 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2022-07-13 15:15:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 15:15:56,833 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 [2022-07-13 15:15:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:56,834 INFO L225 Difference]: With dead ends: 84 [2022-07-13 15:15:56,835 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 15:15:56,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=236, Invalid=2324, Unknown=6, NotChecked=404, Total=2970 [2022-07-13 15:15:56,837 INFO L413 NwaCegarLoop]: 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 [2022-07-13 15:15:56,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 373 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 428 Invalid, 0 Unknown, 27 Unchecked, 0.3s Time] [2022-07-13 15:15:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 15:15:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2022-07-13 15:15:56,844 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) [2022-07-13 15:15:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-13 15:15:56,845 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-07-13 15:15:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:56,845 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-13 15:15:56,846 INFO L496 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) [2022-07-13 15:15:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-13 15:15:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:15:56,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:56,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:56,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:15:57,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 15:15:57,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2134977410, now seen corresponding path program 1 times [2022-07-13 15:15:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:15:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195242779] [2022-07-13 15:15:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:15:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:15:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:15:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:15:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:15:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:15:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195242779] [2022-07-13 15:15:57,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195242779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519124794] [2022-07-13 15:15:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:15:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:15:57,432 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) [2022-07-13 15:15:57,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:15:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:15:57,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-13 15:15:57,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:15:57,667 INFO L390 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 [2022-07-13 15:15:57,838 INFO L390 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 [2022-07-13 15:15:57,898 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:15:57,898 INFO L390 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 [2022-07-13 15:15:57,963 INFO L390 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 [2022-07-13 15:15:57,974 INFO L390 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 [2022-07-13 15:15:58,068 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:15:58,068 INFO L390 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 [2022-07-13 15:15:58,073 INFO L390 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 [2022-07-13 15:15:58,213 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:15:58,213 INFO L390 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 [2022-07-13 15:15:58,218 INFO L390 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 [2022-07-13 15:15:58,225 INFO L390 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 [2022-07-13 15:15:58,230 INFO L390 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 [2022-07-13 15:15:58,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:58,374 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:15:58,374 INFO L390 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 [2022-07-13 15:15:58,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:58,380 INFO L390 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 [2022-07-13 15:15:58,394 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:15:58,395 INFO L390 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 [2022-07-13 15:15:58,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:15:58,420 INFO L390 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 [2022-07-13 15:15:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:15:58,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:15:58,891 WARN L833 $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 [2022-07-13 15:15:59,199 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_711 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| 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_14| v_ArrVal_720))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_721)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select .cse3 .cse0)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|) 0)) (not (= .cse0 (select .cse1 .cse2))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| |c_#StackHeapBarrier|)) (= |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_14| v_ArrVal_722) .cse0 v_ArrVal_711) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_710) (select (select (store (store .cse3 .cse0 (store .cse1 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse4 .cse0 v_ArrVal_709) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_705) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) is different from false [2022-07-13 15:15:59,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519124794] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:15:59,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:15:59,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2022-07-13 15:15:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427564203] [2022-07-13 15:15:59,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:15:59,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 15:15:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:15:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 15:15:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1739, Unknown=5, NotChecked=170, Total=2070 [2022-07-13 15:15:59,204 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) [2022-07-13 15:15:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:15:59,774 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-07-13 15:15:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 15:15:59,775 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 [2022-07-13 15:15:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:15:59,776 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:15:59,776 INFO L226 Difference]: Without dead ends: 65 [2022-07-13 15:15:59,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=2511, Unknown=5, NotChecked=206, Total=2970 [2022-07-13 15:15:59,778 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:15:59,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 297 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 357 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-07-13 15:15:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-13 15:15:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-07-13 15:15:59,787 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) [2022-07-13 15:15:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-07-13 15:15:59,788 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 39 [2022-07-13 15:15:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:15:59,788 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-07-13 15:15:59,789 INFO L496 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) [2022-07-13 15:15:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-07-13 15:15:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:15:59,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:15:59,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:15:59,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 15:15:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:15:59,995 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:15:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:15:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1887720382, now seen corresponding path program 1 times [2022-07-13 15:15:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:15:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921700750] [2022-07-13 15:15:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:15:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:16:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:16:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:16:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:16:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:16:00,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:16:00,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921700750] [2022-07-13 15:16:00,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921700750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:00,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795738802] [2022-07-13 15:16:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:00,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:16:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:16:00,667 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) [2022-07-13 15:16:00,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:16:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:00,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-13 15:16:00,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:00,865 INFO L390 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 [2022-07-13 15:16:00,993 INFO L390 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 [2022-07-13 15:16:01,117 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:16:01,118 INFO L390 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 [2022-07-13 15:16:01,186 INFO L390 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 [2022-07-13 15:16:01,273 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:01,273 INFO L390 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 [2022-07-13 15:16:01,414 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:16:01,415 INFO L390 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 [2022-07-13 15:16:01,421 INFO L390 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 [2022-07-13 15:16:01,425 INFO L390 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 [2022-07-13 15:16:01,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:01,566 INFO L390 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 [2022-07-13 15:16:01,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:01,587 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:16:01,587 INFO L390 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 [2022-07-13 15:16:01,600 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:16:01,600 INFO L390 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 [2022-07-13 15:16:02,073 INFO L356 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-07-13 15:16:02,073 INFO L390 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 [2022-07-13 15:16:02,102 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:16:02,102 INFO L390 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 [2022-07-13 15:16:02,121 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-13 15:16:02,121 INFO L390 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 [2022-07-13 15:16:02,207 INFO L390 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 [2022-07-13 15:16:02,290 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-13 15:16:02,291 INFO L390 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 [2022-07-13 15:16:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:16:02,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:02,315 WARN L833 $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 [2022-07-13 15:16:02,466 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_907 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (let ((.cse3 (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 ((.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (or (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 .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |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 .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 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 [2022-07-13 15:16:02,484 WARN L833 $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_10| Int) (v_ArrVal_907 (Array Int Int))) (let ((.cse4 (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 ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) (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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |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| .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|)))))) (not (= .cse4 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|)))))))) is different from false [2022-07-13 15:16:02,494 WARN L833 $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_10| Int) (v_ArrVal_907 (Array Int Int))) (let ((.cse4 (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 ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) (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 ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#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| .cse2 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|)))))) (not (= .cse4 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|)))))))) is different from false [2022-07-13 15:16:02,561 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_910 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_919 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int) (v_ArrVal_907 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_920))) (let ((.cse6 (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_17| v_ArrVal_919))) (let ((.cse3 (select (select .cse4 .cse6) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse5 (select .cse4 .cse3))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| |c_#StackHeapBarrier|)) (not (let ((.cse1 (store (store .cse4 .cse3 (store .cse5 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| 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 .cse2 .cse3 v_ArrVal_912) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|) 0)) (not (= (select .cse5 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|) .cse6)))))))) is different from false [2022-07-13 15:16:02,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795738802] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:02,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:16:02,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 43 [2022-07-13 15:16:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000290281] [2022-07-13 15:16:02,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:16:02,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 15:16:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:16:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 15:16:02,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1845, Unknown=6, NotChecked=450, Total=2450 [2022-07-13 15:16:02,570 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) [2022-07-13 15:16:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:16:03,236 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-07-13 15:16:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 15:16:03,238 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 [2022-07-13 15:16:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:16:03,240 INFO L225 Difference]: With dead ends: 75 [2022-07-13 15:16:03,240 INFO L226 Difference]: Without dead ends: 67 [2022-07-13 15:16:03,241 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:16:03,242 INFO L413 NwaCegarLoop]: 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 [2022-07-13 15:16:03,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 511 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 618 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2022-07-13 15:16:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-13 15:16:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2022-07-13 15:16:03,257 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) [2022-07-13 15:16:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-07-13 15:16:03,259 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 39 [2022-07-13 15:16:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:16:03,260 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-07-13 15:16:03,260 INFO L496 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) [2022-07-13 15:16:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-07-13 15:16:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 15:16:03,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:16:03,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:16:03,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:03,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:16:03,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:16:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:16:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1669816953, now seen corresponding path program 1 times [2022-07-13 15:16:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:16:03,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666729939] [2022-07-13 15:16:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:16:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:16:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:16:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:16:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:16:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:16:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666729939] [2022-07-13 15:16:04,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666729939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441413343] [2022-07-13 15:16:04,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:04,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:16:04,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:16:04,932 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) [2022-07-13 15:16:04,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:16:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:05,308 WARN L261 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 202 conjunts are in the unsatisfiable core [2022-07-13 15:16:05,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:05,376 INFO L390 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 [2022-07-13 15:16:05,551 INFO L390 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 [2022-07-13 15:16:05,618 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:16:05,618 INFO L390 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 [2022-07-13 15:16:05,685 INFO L390 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 [2022-07-13 15:16:05,691 INFO L390 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 [2022-07-13 15:16:05,785 INFO L390 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 [2022-07-13 15:16:05,788 INFO L390 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 [2022-07-13 15:16:05,942 INFO L390 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 [2022-07-13 15:16:05,946 INFO L390 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 [2022-07-13 15:16:05,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:05,954 INFO L390 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 [2022-07-13 15:16:05,959 INFO L390 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 [2022-07-13 15:16:06,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:06,141 INFO L390 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 [2022-07-13 15:16:06,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:06,147 INFO L390 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 [2022-07-13 15:16:06,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:06,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:06,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:06,154 INFO L390 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 [2022-07-13 15:16:06,168 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-13 15:16:06,168 INFO L390 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 [2022-07-13 15:16:06,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:06,793 INFO L356 Elim1Store]: treesize reduction 208, result has 23.2 percent of original size [2022-07-13 15:16:06,795 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:16:06,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:06,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:16:06,996 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_73| input size 102 context size 102 output size 102 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:16:06,999 INFO L158 Benchmark]: Toolchain (without parser) took 16321.37ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 57.5MB in the beginning and 34.5MB in the end (delta: 23.0MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2022-07-13 15:16:06,999 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 79.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:16:06,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.77ms. Allocated memory is still 96.5MB. Free memory was 57.4MB in the beginning and 40.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 15:16:07,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.44ms. Allocated memory is still 96.5MB. Free memory was 40.2MB in the beginning and 74.7MB in the end (delta: -34.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-13 15:16:07,000 INFO L158 Benchmark]: Boogie Preprocessor took 46.79ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 72.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:16:07,000 INFO L158 Benchmark]: RCFGBuilder took 426.77ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 57.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 15:16:07,000 INFO L158 Benchmark]: TraceAbstraction took 15402.78ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 56.8MB in the beginning and 34.5MB in the end (delta: 22.2MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2022-07-13 15:16:07,001 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 79.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.77ms. Allocated memory is still 96.5MB. Free memory was 57.4MB in the beginning and 40.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.44ms. Allocated memory is still 96.5MB. Free memory was 40.2MB in the beginning and 74.7MB in the end (delta: -34.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.79ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 72.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.77ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 57.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15402.78ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 56.8MB in the beginning and 34.5MB in the end (delta: 22.2MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_73| input size 102 context size 102 output size 102 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_73| input size 102 context size 102 output size 102: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:16:07,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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-?-f4b24e3 [2022-07-13 15:16:08,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:16:08,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:16:09,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:16:09,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:16:09,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:16:09,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:16:09,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:16:09,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:16:09,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:16:09,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:16:09,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:16:09,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:16:09,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:16:09,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:16:09,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:16:09,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:16:09,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:16:09,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:16:09,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:16:09,055 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:16:09,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:16:09,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:16:09,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:16:09,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:16:09,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:16:09,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:16:09,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:16:09,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:16:09,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:16:09,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:16:09,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:16:09,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:16:09,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:16:09,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:16:09,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:16:09,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:16:09,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:16:09,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:16:09,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:16:09,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:16:09,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:16:09,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:16:09,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:16:09,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:16:09,116 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:16:09,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:16:09,117 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:16:09,117 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:16:09,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:16:09,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:16:09,119 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:16:09,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:16:09,123 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:16:09,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:16:09,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:16:09,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:16:09,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:16:09,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:16:09,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:16:09,125 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:16:09,125 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:16:09,125 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:16:09,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:16:09,126 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:16:09,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:16:09,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:16:09,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:16:09,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:16:09,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:16:09,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:16:09,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:16:09,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:16:09,128 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:16:09,128 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:16:09,129 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:16:09,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:16:09,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:16:09,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:16:09,130 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 [2022-07-13 15:16:09,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:16:09,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:16:09,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:16:09,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:16:09,467 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:16:09,468 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 [2022-07-13 15:16:09,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eea6d55c/e6756262e4974426a576fcca0315547d/FLAG3c590a0c6 [2022-07-13 15:16:10,011 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:16:10,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-07-13 15:16:10,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eea6d55c/e6756262e4974426a576fcca0315547d/FLAG3c590a0c6 [2022-07-13 15:16:10,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eea6d55c/e6756262e4974426a576fcca0315547d [2022-07-13 15:16:10,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:16:10,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:16:10,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:16:10,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:16:10,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:16:10,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:10,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f1ffdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10, skipping insertion in model container [2022-07-13 15:16:10,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:10,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:16:10,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:16:10,887 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] [2022-07-13 15:16:10,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:16:10,906 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:16:10,960 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] [2022-07-13 15:16:10,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:16:10,994 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:16:10,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10 WrapperNode [2022-07-13 15:16:10,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:16:10,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:16:10,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:16:10,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:16:11,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,064 INFO L137 Inliner]: procedures = 130, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 159 [2022-07-13 15:16:11,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:16:11,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:16:11,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:16:11,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:16:11,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:16:11,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:16:11,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:16:11,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:16:11,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (1/1) ... [2022-07-13 15:16:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:16:11,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:16:11,136 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) [2022-07-13 15:16:11,140 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 [2022-07-13 15:16:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 15:16:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:16:11,171 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:16:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:16:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:16:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:16:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:16:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:16:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:16:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 15:16:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:16:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:16:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:16:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:16:11,269 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:16:11,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:16:11,587 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:16:11,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:16:11,593 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 15:16:11,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:16:11 BoogieIcfgContainer [2022-07-13 15:16:11,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:16:11,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:16:11,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:16:11,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:16:11,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:16:10" (1/3) ... [2022-07-13 15:16:11,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d5e452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:16:11, skipping insertion in model container [2022-07-13 15:16:11,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:16:10" (2/3) ... [2022-07-13 15:16:11,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d5e452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:16:11, skipping insertion in model container [2022-07-13 15:16:11,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:16:11" (3/3) ... [2022-07-13 15:16:11,600 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-07-13 15:16:11,611 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:16:11,612 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:16:11,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:16:11,653 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72e5b4d6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@690227b0 [2022-07-13 15:16:11,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:16:11,656 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) [2022-07-13 15:16:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:16:11,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:16:11,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:16:11,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:16:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:16:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2119803949, now seen corresponding path program 1 times [2022-07-13 15:16:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:16:11,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136900933] [2022-07-13 15:16:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:11,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:16:11,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:16:11,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:16:11,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:16:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:11,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:16:11,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:16:11,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:16:11,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:16:11,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136900933] [2022-07-13 15:16:11,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136900933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:16:11,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:16:11,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:16:11,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589405047] [2022-07-13 15:16:11,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:16:11,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:16:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:16:11,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:16:11,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:16:11,951 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:16:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:16:11,971 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2022-07-13 15:16:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:16:11,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-13 15:16:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:16:11,979 INFO L225 Difference]: With dead ends: 71 [2022-07-13 15:16:11,979 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:16:11,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:16:11,984 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:16:11,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:16:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:16:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 15:16:12,017 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) [2022-07-13 15:16:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 15:16:12,020 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2022-07-13 15:16:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:16:12,021 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 15:16:12,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:16:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 15:16:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:16:12,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:16:12,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:16:12,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:12,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:16:12,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:16:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:16:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash -826043684, now seen corresponding path program 1 times [2022-07-13 15:16:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:16:12,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977380813] [2022-07-13 15:16:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:16:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:16:12,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:16:12,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:16:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:12,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:16:12,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:16:12,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:16:12,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:16:12,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977380813] [2022-07-13 15:16:12,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977380813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:16:12,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:16:12,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:16:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362714994] [2022-07-13 15:16:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:16:12,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:16:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:16:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:16:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:16:12,397 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:16:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:16:12,417 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-07-13 15:16:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:16:12,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-13 15:16:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:16:12,419 INFO L225 Difference]: With dead ends: 58 [2022-07-13 15:16:12,419 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:16:12,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:16:12,420 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:16:12,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:16:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:16:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-13 15:16:12,426 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) [2022-07-13 15:16:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-07-13 15:16:12,426 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2022-07-13 15:16:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:16:12,427 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-13 15:16:12,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:16:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-07-13 15:16:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 15:16:12,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:16:12,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:16:12,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:12,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:16:12,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:16:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:16:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720012, now seen corresponding path program 1 times [2022-07-13 15:16:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:16:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978378845] [2022-07-13 15:16:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:12,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:16:12,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:16:12,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:16:12,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:16:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:12,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 15:16:12,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:13,086 INFO L390 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 8 treesize of output 4 [2022-07-13 15:16:13,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:13,281 INFO L390 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 15 treesize of output 17 [2022-07-13 15:16:13,350 INFO L390 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 16 treesize of output 8 [2022-07-13 15:16:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:16:13,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:13,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:16:13,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978378845] [2022-07-13 15:16:13,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978378845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:13,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [964269299] [2022-07-13 15:16:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:13,485 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:16:13,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:16:13,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:16:13,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-07-13 15:16:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:13,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 15:16:13,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:14,108 INFO L390 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 8 treesize of output 4 [2022-07-13 15:16:14,242 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:16:14,242 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-13 15:16:14,354 INFO L390 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 16 treesize of output 8 [2022-07-13 15:16:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:16:14,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:14,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [964269299] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:14,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:16:14,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2022-07-13 15:16:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423889893] [2022-07-13 15:16:14,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:16:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 15:16:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:16:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 15:16:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=445, Unknown=23, NotChecked=0, Total=552 [2022-07-13 15:16:14,467 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 22 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 15:16:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:16:14,813 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-07-13 15:16:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:16:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 2 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 [2022-07-13 15:16:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:16:14,817 INFO L225 Difference]: With dead ends: 44 [2022-07-13 15:16:14,817 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 15:16:14,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=611, Unknown=25, NotChecked=0, Total=756 [2022-07-13 15:16:14,818 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:16:14,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 196 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2022-07-13 15:16:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 15:16:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-13 15:16:14,823 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) [2022-07-13 15:16:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-13 15:16:14,823 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2022-07-13 15:16:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:16:14,824 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-13 15:16:14,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 15:16:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-13 15:16:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:16:14,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:16:14,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:16:14,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2022-07-13 15:16:15,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:15,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:16:15,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:16:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:16:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash -158694653, now seen corresponding path program 1 times [2022-07-13 15:16:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:16:15,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049041238] [2022-07-13 15:16:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:15,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:16:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:16:15,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:16:15,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:16:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:15,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 15:16:15,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:15,510 INFO L390 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 [2022-07-13 15:16:15,705 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:16:15,705 INFO L390 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 20 treesize of output 27 [2022-07-13 15:16:15,776 INFO L390 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 [2022-07-13 15:16:15,873 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:15,874 INFO L390 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 31 treesize of output 32 [2022-07-13 15:16:16,030 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-13 15:16:16,031 INFO L390 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 50 treesize of output 34 [2022-07-13 15:16:16,044 INFO L390 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 13 treesize of output 9 [2022-07-13 15:16:16,054 INFO L390 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 14 treesize of output 10 [2022-07-13 15:16:16,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:16,275 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:16:16,276 INFO L390 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 56 treesize of output 54 [2022-07-13 15:16:16,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:16,294 INFO L390 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 47 treesize of output 47 [2022-07-13 15:16:16,329 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-13 15:16:16,330 INFO L390 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 35 treesize of output 37 [2022-07-13 15:16:16,428 INFO L390 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 44 treesize of output 32 [2022-07-13 15:16:16,534 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-13 15:16:16,535 INFO L390 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 55 treesize of output 31 [2022-07-13 15:16:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:16:16,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:16,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:16:16,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049041238] [2022-07-13 15:16:16,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049041238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:16,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [597362496] [2022-07-13 15:16:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:16:16,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:16:16,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:16:16,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-13 15:16:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:17,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-13 15:16:17,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:17,201 INFO L390 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 [2022-07-13 15:16:17,550 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:16:17,551 INFO L390 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 20 treesize of output 27 [2022-07-13 15:16:17,668 INFO L390 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 [2022-07-13 15:16:17,804 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:17,805 INFO L390 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 32 treesize of output 33 [2022-07-13 15:16:18,044 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:16:18,044 INFO L390 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 61 treesize of output 28 [2022-07-13 15:16:18,052 INFO L390 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 [2022-07-13 15:16:18,058 INFO L390 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 18 treesize of output 14 [2022-07-13 15:16:20,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:20,380 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-13 15:16:20,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 60 [2022-07-13 15:16:20,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:20,396 INFO L390 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 55 treesize of output 53 [2022-07-13 15:16:20,423 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-13 15:16:20,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 41 [2022-07-13 15:16:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:16:21,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:21,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (_ BitVec 32)) (v_ArrVal_406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_403 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_403) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_404)))) (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 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_406) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_402) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))))) is different from false [2022-07-13 15:16:23,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [597362496] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:23,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:16:23,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 37 [2022-07-13 15:16:23,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930014312] [2022-07-13 15:16:23,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:16:23,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 15:16:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:16:23,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 15:16:23,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2032, Unknown=30, NotChecked=92, Total=2352 [2022-07-13 15:16:23,745 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 37 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 28 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:16:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:16:28,669 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-07-13 15:16:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 15:16:28,674 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 28 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2022-07-13 15:16:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:16:28,674 INFO L225 Difference]: With dead ends: 65 [2022-07-13 15:16:28,675 INFO L226 Difference]: Without dead ends: 53 [2022-07-13 15:16:28,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=262, Invalid=2572, Unknown=32, NotChecked=104, Total=2970 [2022-07-13 15:16:28,676 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:16:28,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 323 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 105 Invalid, 0 Unknown, 92 Unchecked, 0.2s Time] [2022-07-13 15:16:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-13 15:16:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-13 15:16:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:16:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-07-13 15:16:28,695 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 37 [2022-07-13 15:16:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:16:28,699 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-13 15:16:28,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 28 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:16:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-07-13 15:16:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:16:28,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:16:28,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:16:28,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:28,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:29,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:16:29,115 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:16:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:16:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1887720382, now seen corresponding path program 1 times [2022-07-13 15:16:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:16:29,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955424106] [2022-07-13 15:16:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:29,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:16:29,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:16:29,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:16:29,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 15:16:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:29,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-13 15:16:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:29,409 INFO L390 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 [2022-07-13 15:16:29,422 INFO L390 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 [2022-07-13 15:16:29,480 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:16:29,480 INFO L390 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 24 [2022-07-13 15:16:29,545 INFO L390 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 13 treesize of output 9 [2022-07-13 15:16:29,602 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:16:29,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-13 15:16:29,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-07-13 15:16:29,769 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:29,769 INFO L390 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 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-13 15:16:29,893 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 15:16:29,894 INFO L390 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 72 treesize of output 27 [2022-07-13 15:16:29,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 13 [2022-07-13 15:16:30,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:30,080 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:16:30,081 INFO L390 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 78 treesize of output 68 [2022-07-13 15:16:30,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:30,090 INFO L390 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 61 treesize of output 59 [2022-07-13 15:16:30,130 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-13 15:16:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 44 [2022-07-13 15:16:30,846 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-07-13 15:16:30,846 INFO L390 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 72 [2022-07-13 15:16:30,906 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:16:30,907 INFO L390 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 196 treesize of output 121 [2022-07-13 15:16:30,928 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:16:30,928 INFO L390 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 1 case distinctions, treesize of input 166 treesize of output 131 [2022-07-13 15:16:30,952 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:30,952 INFO L390 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 134 treesize of output 127 [2022-07-13 15:16:31,057 INFO L390 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 119 treesize of output 91 [2022-07-13 15:16:31,191 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 15:16:31,192 INFO L390 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 114 treesize of output 36 [2022-07-13 15:16:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:16:31,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:31,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (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|) |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_500))) (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| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-13 15:16:31,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (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 ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_500))) (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| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-13 15:16:31,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (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 (select |c_#memory_$Pointer$.offset| |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) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_500))) (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 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-07-13 15:16:31,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_496 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (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 (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 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_500))) (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| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_496) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-13 15:16:31,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:16:31,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955424106] [2022-07-13 15:16:31,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955424106] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:31,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1406654302] [2022-07-13 15:16:31,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:31,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:16:31,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:16:31,883 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:16:31,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-13 15:16:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:32,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-13 15:16:32,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:32,339 INFO L390 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 [2022-07-13 15:16:32,720 INFO L390 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 8 treesize of output 6 [2022-07-13 15:16:32,996 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:16:32,996 INFO L390 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 20 treesize of output 27 [2022-07-13 15:16:33,118 INFO L390 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 [2022-07-13 15:16:33,139 INFO L390 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 [2022-07-13 15:16:33,296 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:33,297 INFO L390 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 49 treesize of output 46 [2022-07-13 15:16:33,301 INFO L390 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 [2022-07-13 15:16:33,609 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:16:33,610 INFO L390 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 84 treesize of output 43 [2022-07-13 15:16:33,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-13 15:16:33,627 INFO L390 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 18 treesize of output 14 [2022-07-13 15:16:33,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:33,863 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:16:33,863 INFO L390 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 90 treesize of output 80 [2022-07-13 15:16:33,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:33,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:33,886 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 15:16:33,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 82 [2022-07-13 15:16:33,917 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-13 15:16:33,917 INFO L390 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 39 treesize of output 41 [2022-07-13 15:16:35,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:35,169 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:16:35,170 INFO L390 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 100 [2022-07-13 15:16:35,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:35,238 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-13 15:16:35,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 95 [2022-07-13 15:16:35,595 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 15:16:35,595 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 52 [2022-07-13 15:16:35,765 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:16:35,766 INFO L390 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 66 treesize of output 29 [2022-07-13 15:16:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:16:36,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:36,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_595 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_592) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_595))) (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_593) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_594) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-13 15:16:38,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1406654302] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:38,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:16:38,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 45 [2022-07-13 15:16:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304584051] [2022-07-13 15:16:38,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:16:38,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-13 15:16:38,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:16:38,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-13 15:16:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2550, Unknown=16, NotChecked=530, Total=3306 [2022-07-13 15:16:38,266 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 34 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:16:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:16:39,977 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-07-13 15:16:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 15:16:39,978 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 34 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2022-07-13 15:16:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:16:39,979 INFO L225 Difference]: With dead ends: 68 [2022-07-13 15:16:39,979 INFO L226 Difference]: Without dead ends: 60 [2022-07-13 15:16:39,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=305, Invalid=3731, Unknown=16, NotChecked=640, Total=4692 [2022-07-13 15:16:39,981 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:16:39,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 336 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 187 Invalid, 0 Unknown, 115 Unchecked, 0.3s Time] [2022-07-13 15:16:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-13 15:16:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-07-13 15:16:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:16:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-07-13 15:16:39,990 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 39 [2022-07-13 15:16:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:16:39,991 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-07-13 15:16:39,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 34 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:16:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-07-13 15:16:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 15:16:39,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:16:39,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:16:40,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:40,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:16:40,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:16:40,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:16:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:16:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1669816953, now seen corresponding path program 1 times [2022-07-13 15:16:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:16:40,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850019999] [2022-07-13 15:16:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:40,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:16:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:16:40,399 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:16:40,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 15:16:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:40,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-13 15:16:40,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:40,661 INFO L390 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 [2022-07-13 15:16:40,682 INFO L390 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 [2022-07-13 15:16:40,765 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:16:40,767 INFO L390 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 24 [2022-07-13 15:16:40,863 INFO L390 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 13 treesize of output 9 [2022-07-13 15:16:40,928 INFO L390 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 11 treesize of output 7 [2022-07-13 15:16:41,009 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:16:41,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-13 15:16:41,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:16:41,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-07-13 15:16:41,145 INFO L390 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 19 treesize of output 18 [2022-07-13 15:16:41,287 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:16:41,287 INFO L390 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 1 case distinctions, treesize of input 58 treesize of output 53 [2022-07-13 15:16:41,305 INFO L390 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 18 treesize of output 20 [2022-07-13 15:16:41,312 INFO L390 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 18 treesize of output 20 [2022-07-13 15:16:41,530 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 15:16:41,530 INFO L390 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 99 treesize of output 46 [2022-07-13 15:16:41,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-13 15:16:41,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:16:41,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 14 [2022-07-13 15:16:41,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:41,814 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-13 15:16:41,815 INFO L390 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 105 treesize of output 91 [2022-07-13 15:16:41,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:41,825 INFO L390 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 [2022-07-13 15:16:41,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:41,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:41,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 81 [2022-07-13 15:16:41,857 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-13 15:16:41,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-07-13 15:16:42,766 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-07-13 15:16:42,766 INFO L390 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 99 [2022-07-13 15:16:42,843 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-13 15:16:42,843 INFO L390 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 259 treesize of output 160 [2022-07-13 15:16:42,879 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 15:16:42,880 INFO L390 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 225 treesize of output 180 [2022-07-13 15:16:42,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2022-07-13 15:16:42,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:42,907 INFO L390 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 37 treesize of output 42 [2022-07-13 15:16:43,052 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 15:16:43,053 INFO L390 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 125 treesize of output 47 [2022-07-13 15:16:43,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-13 15:16:43,176 INFO L390 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 [2022-07-13 15:16:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:16:43,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:16:43,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_697 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_700 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_701 (Array (_ BitVec 32) (_ BitVec 32)))) (= |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_700) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_697) (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|) |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_695) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-13 15:16:45,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:16:45,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850019999] [2022-07-13 15:16:45,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850019999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:16:45,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1679943377] [2022-07-13 15:16:45,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:16:45,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:16:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:16:45,125 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:16:45,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-13 15:16:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:16:45,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-13 15:16:45,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:16:45,692 INFO L390 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 [2022-07-13 15:16:46,238 INFO L390 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 11 treesize of output 7 [2022-07-13 15:16:46,394 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:16:46,394 INFO L390 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 20 treesize of output 27 [2022-07-13 15:16:46,562 INFO L390 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 [2022-07-13 15:16:46,570 INFO L390 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 [2022-07-13 15:16:46,583 INFO L390 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 [2022-07-13 15:16:46,798 INFO L390 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 [2022-07-13 15:16:46,804 INFO L390 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 [2022-07-13 15:16:46,810 INFO L390 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 6 treesize of output 5 [2022-07-13 15:16:47,217 INFO L390 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 55 treesize of output 35 [2022-07-13 15:16:47,225 INFO L390 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 18 treesize of output 14 [2022-07-13 15:16:47,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:47,234 INFO L390 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-13 15:16:47,238 INFO L390 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 [2022-07-13 15:16:47,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:47,690 INFO L390 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 61 treesize of output 55 [2022-07-13 15:16:47,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:47,702 INFO L390 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 [2022-07-13 15:16:47,745 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-13 15:16:47,746 INFO L390 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 27 treesize of output 29 [2022-07-13 15:16:47,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:47,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:47,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-13 15:16:49,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:49,621 INFO L356 Elim1Store]: treesize reduction 97, result has 29.2 percent of original size [2022-07-13 15:16:49,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 559 treesize of output 350 [2022-07-13 15:16:49,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:49,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:49,901 INFO L356 Elim1Store]: treesize reduction 101, result has 15.1 percent of original size [2022-07-13 15:16:49,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 400 treesize of output 446 [2022-07-13 15:16:49,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:49,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:50,230 INFO L356 Elim1Store]: treesize reduction 75, result has 33.6 percent of original size [2022-07-13 15:16:50,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 649 treesize of output 463 [2022-07-13 15:16:50,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:50,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:50,402 INFO L356 Elim1Store]: treesize reduction 105, result has 11.8 percent of original size [2022-07-13 15:16:50,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 578 treesize of output 588 [2022-07-13 15:16:50,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-07-13 15:16:50,571 INFO L356 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-07-13 15:16:50,572 INFO L390 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 29 treesize of output 47 [2022-07-13 15:16:50,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 33 [2022-07-13 15:16:50,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-13 15:16:51,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:51,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 1 [2022-07-13 15:16:51,237 INFO L390 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 28 treesize of output 27 [2022-07-13 15:16:51,490 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:16:51,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 468 treesize of output 389 [2022-07-13 15:16:51,682 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 15:16:52,109 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:16:52,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 469 treesize of output 390 [2022-07-13 15:16:52,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 33 [2022-07-13 15:16:53,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 33 [2022-07-13 15:16:53,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 412 [2022-07-13 15:16:54,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:54,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 30 treesize of output 20 [2022-07-13 15:16:57,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 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 57 treesize of output 61 [2022-07-13 15:16:57,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-07-13 15:16:57,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:57,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2022-07-13 15:16:59,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 74 [2022-07-13 15:16:59,373 INFO L390 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 9 treesize of output 7 [2022-07-13 15:16:59,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:16:59,744 INFO L356 Elim1Store]: treesize reduction 54, result has 8.5 percent of original size [2022-07-13 15:16:59,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 98 [2022-07-13 15:17:01,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:01,580 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2022-07-13 15:17:01,589 INFO L390 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 [2022-07-13 15:17:04,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:04,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 562 [2022-07-13 15:17:07,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:07,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:07,445 INFO L356 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-07-13 15:17:07,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 89 [2022-07-13 15:17:07,454 INFO L390 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 9 treesize of output 7 [2022-07-13 15:17:07,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2022-07-13 15:17:07,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:07,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:07,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:07,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:07,682 INFO L356 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2022-07-13 15:17:07,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 104 [2022-07-13 15:17:07,693 INFO L390 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 9 treesize of output 7 [2022-07-13 15:17:07,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2022-07-13 15:17:07,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2022-07-13 15:17:07,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2022-07-13 15:17:08,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:08,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:08,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:08,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:17:08,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 69 treesize of output 68 [2022-07-13 15:17:08,091 INFO L390 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 9 treesize of output 7 [2022-07-13 15:17:08,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2022-07-13 15:17:08,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2022-07-13 15:17:12,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:12,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:13,160 INFO L356 Elim1Store]: treesize reduction 165, result has 27.3 percent of original size [2022-07-13 15:17:13,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 584 treesize of output 518 [2022-07-13 15:17:13,166 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:17:13,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:13,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:13,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:17:13,568 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:17:13,571 INFO L158 Benchmark]: Toolchain (without parser) took 63027.04ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 39.5MB in the beginning and 19.3MB in the end (delta: 20.2MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2022-07-13 15:17:13,571 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 46.1MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:17:13,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.74ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 31.0MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 15:17:13,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.23ms. Allocated memory is still 56.6MB. Free memory was 31.0MB in the beginning and 28.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:17:13,572 INFO L158 Benchmark]: Boogie Preprocessor took 27.93ms. Allocated memory is still 56.6MB. Free memory was 28.7MB in the beginning and 26.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:17:13,573 INFO L158 Benchmark]: RCFGBuilder took 491.23ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 36.4MB in the end (delta: 3.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-07-13 15:17:13,573 INFO L158 Benchmark]: TraceAbstraction took 61974.87ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 36.0MB in the beginning and 19.3MB in the end (delta: 16.7MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2022-07-13 15:17:13,574 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 46.1MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.74ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 31.0MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.23ms. Allocated memory is still 56.6MB. Free memory was 31.0MB in the beginning and 28.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.93ms. Allocated memory is still 56.6MB. Free memory was 28.7MB in the beginning and 26.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.23ms. Allocated memory is still 56.6MB. Free memory was 39.6MB in the beginning and 36.4MB in the end (delta: 3.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 61974.87ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 36.0MB in the beginning and 19.3MB in the end (delta: 16.7MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:17:13,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER