./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/heap-manipulation/sll_to_dll_rev-2.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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:46:03,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:46:03,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:46:03,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:46:03,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:46:03,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:46:03,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:46:03,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:46:03,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:46:03,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:46:03,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:46:03,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:46:03,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:46:03,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:46:03,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:46:03,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:46:03,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:46:03,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:46:03,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:46:03,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:46:03,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:46:03,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:46:03,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:46:03,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:46:03,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:46:03,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:46:03,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:46:03,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:46:03,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:46:03,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:46:03,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:46:03,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:46:03,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:46:03,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:46:03,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:46:03,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:46:03,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:46:03,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:46:03,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:46:03,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:46:03,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:46:03,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 23:46:03,242 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:46:03,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:46:03,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:46:03,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:46:03,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:46:03,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:46:03,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:46:03,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:46:03,245 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:46:03,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:46:03,246 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:46:03,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 23:46:03,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:46:03,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:46:03,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:46:03,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:46:03,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:46:03,247 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:46:03,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:46:03,247 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:46:03,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:46:03,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:46:03,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:46:03,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:46:03,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:46:03,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:46:03,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:46:03,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:46:03,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 23:46:03,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 23:46:03,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:46:03,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:46:03,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:46:03,249 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2021-12-27 23:46:03,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:46:03,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:46:03,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:46:03,549 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:46:03,550 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:46:03,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2021-12-27 23:46:03,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf307326b/8124c99370bf4a3f88dd0bf85a278c96/FLAG65b41d358 [2021-12-27 23:46:04,059 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:46:04,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2021-12-27 23:46:04,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf307326b/8124c99370bf4a3f88dd0bf85a278c96/FLAG65b41d358 [2021-12-27 23:46:04,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf307326b/8124c99370bf4a3f88dd0bf85a278c96 [2021-12-27 23:46:04,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:46:04,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:46:04,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:46:04,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:46:04,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:46:04,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f3c5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04, skipping insertion in model container [2021-12-27 23:46:04,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:46:04,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:46:04,352 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/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2021-12-27 23:46:04,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:46:04,407 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:46:04,441 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/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2021-12-27 23:46:04,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:46:04,470 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:46:04,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04 WrapperNode [2021-12-27 23:46:04,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:46:04,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:46:04,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:46:04,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:46:04,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,531 INFO L137 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 200 [2021-12-27 23:46:04,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:46:04,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:46:04,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:46:04,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:46:04,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:46:04,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:46:04,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:46:04,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:46:04,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (1/1) ... [2021-12-27 23:46:04,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:46:04,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:04,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 23:46:04,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 23:46:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-27 23:46:04,656 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-27 23:46:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 23:46:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:46:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 23:46:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-27 23:46:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-27 23:46:04,657 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2021-12-27 23:46:04,658 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2021-12-27 23:46:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:46:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-27 23:46:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2021-12-27 23:46:04,658 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2021-12-27 23:46:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 23:46:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2021-12-27 23:46:04,659 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2021-12-27 23:46:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:46:04,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:46:04,778 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:46:04,780 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:46:05,048 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:46:05,053 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:46:05,062 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-12-27 23:46:05,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:05 BoogieIcfgContainer [2021-12-27 23:46:05,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:46:05,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:46:05,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:46:05,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:46:05,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:46:04" (1/3) ... [2021-12-27 23:46:05,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb2019c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:05, skipping insertion in model container [2021-12-27 23:46:05,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:04" (2/3) ... [2021-12-27 23:46:05,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb2019c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:05, skipping insertion in model container [2021-12-27 23:46:05,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:05" (3/3) ... [2021-12-27 23:46:05,071 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2021-12-27 23:46:05,075 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:46:05,076 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:46:05,130 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:46:05,137 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:46:05,137 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:46:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 82 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-27 23:46:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 23:46:05,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:05,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:05,169 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1660370747, now seen corresponding path program 1 times [2021-12-27 23:46:05,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:05,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406165085] [2021-12-27 23:46:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:05,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:05,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:05,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406165085] [2021-12-27 23:46:05,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406165085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:05,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:05,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:46:05,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960908368] [2021-12-27 23:46:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:05,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:46:05,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:05,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:46:05,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:46:05,378 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 82 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:05,418 INFO L93 Difference]: Finished difference Result 188 states and 326 transitions. [2021-12-27 23:46:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:46:05,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-27 23:46:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:05,435 INFO L225 Difference]: With dead ends: 188 [2021-12-27 23:46:05,435 INFO L226 Difference]: Without dead ends: 88 [2021-12-27 23:46:05,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:46:05,441 INFO L933 BasicCegarLoop]: 115 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, 115 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 [2021-12-27 23:46:05,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-27 23:46:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-27 23:46:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 75 states have internal predecessors, (83), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-27 23:46:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2021-12-27 23:46:05,501 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 16 [2021-12-27 23:46:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:05,501 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2021-12-27 23:46:05,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2021-12-27 23:46:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-27 23:46:05,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:05,504 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:05,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 23:46:05,505 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1299807145, now seen corresponding path program 1 times [2021-12-27 23:46:05,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:05,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345939504] [2021-12-27 23:46:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:05,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-27 23:46:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:05,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 23:46:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:06,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 23:46:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 23:46:06,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:06,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345939504] [2021-12-27 23:46:06,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345939504] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:06,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414497291] [2021-12-27 23:46:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:06,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:06,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:06,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:06,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 23:46:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:06,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-27 23:46:06,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:06,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-27 23:46:06,887 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-27 23:46:06,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-27 23:46:06,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:06,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:46:06,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-27 23:46:06,939 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:06,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2021-12-27 23:46:06,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-27 23:46:07,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-12-27 23:46:07,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-27 23:46:07,225 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (v_ArrVal_329 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= |chain_node_~node~0#1.base| |chain_node_alloc_node_~ptr~0#1.base|) (= (store (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_327) |chain_node_~node~0#1.base| v_ArrVal_328) |c_chain_node_#in~ppnode#1.base| v_ArrVal_329) |c_#memory_$Pointer$.base|) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2021-12-27 23:46:07,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:07,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:07,302 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-12-27 23:46:07,303 INFO L387 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 2 case distinctions, treesize of input 32 treesize of output 45 [2021-12-27 23:46:07,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-27 23:46:07,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-27 23:46:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2021-12-27 23:46:07,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:07,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (|v_chain_node_alloc_node_~ptr~0#1.base_8| Int) (v_ArrVal_336 (Array Int Int)) (|v_chain_node_~node~0#1.base_4| Int) (v_ArrVal_338 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_8| v_ArrVal_337) |v_chain_node_~node~0#1.base_4| v_ArrVal_338) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|) 0)) (< |v_chain_node_alloc_node_~ptr~0#1.base_8| |v_chain_node_~node~0#1.base_4|) (not (< |v_chain_node_alloc_node_~ptr~0#1.base_8| |c_#StackHeapBarrier|)))) is different from false [2021-12-27 23:46:07,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414497291] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:07,475 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:07,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2021-12-27 23:46:07,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880452748] [2021-12-27 23:46:07,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:07,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-27 23:46:07,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:07,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-27 23:46:07,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=442, Unknown=3, NotChecked=86, Total=600 [2021-12-27 23:46:07,478 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-27 23:46:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:08,235 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2021-12-27 23:46:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-27 23:46:08,236 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2021-12-27 23:46:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:08,238 INFO L225 Difference]: With dead ends: 150 [2021-12-27 23:46:08,238 INFO L226 Difference]: Without dead ends: 147 [2021-12-27 23:46:08,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=810, Unknown=5, NotChecked=118, Total=1056 [2021-12-27 23:46:08,239 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:08,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 670 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1177 Invalid, 0 Unknown, 277 Unchecked, 0.5s Time] [2021-12-27 23:46:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-27 23:46:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2021-12-27 23:46:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 93 states have internal predecessors, (104), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-27 23:46:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2021-12-27 23:46:08,261 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 40 [2021-12-27 23:46:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:08,261 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2021-12-27 23:46:08,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-27 23:46:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2021-12-27 23:46:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-27 23:46:08,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:08,262 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2021-12-27 23:46:08,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:08,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:08,472 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash -727961485, now seen corresponding path program 1 times [2021-12-27 23:46:08,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:08,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408951770] [2021-12-27 23:46:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:08,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-27 23:46:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 23:46:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 23:46:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-27 23:46:09,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:09,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408951770] [2021-12-27 23:46:09,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408951770] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:09,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764738151] [2021-12-27 23:46:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:09,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:09,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:09,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-27 23:46:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:09,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-27 23:46:09,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:09,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-27 23:46:09,290 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-27 23:46:09,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-27 23:46:09,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:09,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:46:09,325 INFO L387 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 27 treesize of output 19 [2021-12-27 23:46:09,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-27 23:46:09,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-27 23:46:09,427 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-27 23:46:09,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-12-27 23:46:09,477 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:09,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 8 [2021-12-27 23:46:09,585 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|chain_node_alloc_node_~ptr~0#1.base| Int) (v_ArrVal_643 (Array Int Int))) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (<= |chain_node_~node~0#1.base| |chain_node_alloc_node_~ptr~0#1.base|) (= (store (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_643) |chain_node_~node~0#1.base| v_ArrVal_644) |c_chain_node_#in~ppnode#1.base| v_ArrVal_645) |c_#memory_$Pointer$.base|))) is different from true [2021-12-27 23:46:09,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:09,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:09,642 INFO L353 Elim1Store]: treesize reduction 43, result has 47.6 percent of original size [2021-12-27 23:46:09,643 INFO L387 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 4 case distinctions, treesize of input 32 treesize of output 57 [2021-12-27 23:46:09,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-12-27 23:46:09,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:46:09,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-27 23:46:09,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-27 23:46:09,891 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_649 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_650 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_649) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_650) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$.base|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2021-12-27 23:46:09,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:09,960 INFO L353 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2021-12-27 23:46:09,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 87 [2021-12-27 23:46:09,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:10,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:46:10,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:10,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2021-12-27 23:46:10,074 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-27 23:46:10,149 INFO L353 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2021-12-27 23:46:10,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 60 [2021-12-27 23:46:10,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-27 23:46:10,207 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:10,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2021-12-27 23:46:10,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-12-27 23:46:10,325 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:46:10,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2021-12-27 23:46:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-12-27 23:46:10,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:10,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764738151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:10,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:10,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 29 [2021-12-27 23:46:10,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482498160] [2021-12-27 23:46:10,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:10,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-27 23:46:10,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-27 23:46:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=662, Unknown=14, NotChecked=106, Total=870 [2021-12-27 23:46:10,448 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 23:46:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:11,373 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2021-12-27 23:46:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-27 23:46:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-27 23:46:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:11,375 INFO L225 Difference]: With dead ends: 137 [2021-12-27 23:46:11,375 INFO L226 Difference]: Without dead ends: 134 [2021-12-27 23:46:11,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1302, Unknown=20, NotChecked=150, Total=1640 [2021-12-27 23:46:11,376 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 134 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:11,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 753 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1076 Invalid, 0 Unknown, 271 Unchecked, 0.6s Time] [2021-12-27 23:46:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-27 23:46:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-12-27 23:46:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 98 states have internal predecessors, (108), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-27 23:46:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2021-12-27 23:46:11,384 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 42 [2021-12-27 23:46:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:11,385 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2021-12-27 23:46:11,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 23:46:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2021-12-27 23:46:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-27 23:46:11,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:11,386 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:11,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:11,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-27 23:46:11,604 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1343975071, now seen corresponding path program 1 times [2021-12-27 23:46:11,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:11,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411076387] [2021-12-27 23:46:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:11,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-27 23:46:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 23:46:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 23:46:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 23:46:13,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411076387] [2021-12-27 23:46:13,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411076387] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886560688] [2021-12-27 23:46:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:13,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:13,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:13,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-27 23:46:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:13,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 139 conjunts are in the unsatisfiable core [2021-12-27 23:46:13,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:13,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2021-12-27 23:46:13,438 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-27 23:46:13,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-27 23:46:13,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:13,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:46:13,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:13,472 INFO L387 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 27 treesize of output 19 [2021-12-27 23:46:13,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-27 23:46:13,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-27 23:46:13,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-27 23:46:13,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-27 23:46:13,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:46:13,840 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-27 23:46:13,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-27 23:46:13,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:13,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:46:13,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-27 23:46:13,914 INFO L387 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 64 treesize of output 56 [2021-12-27 23:46:13,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2021-12-27 23:46:14,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2021-12-27 23:46:14,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2021-12-27 23:46:14,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2021-12-27 23:46:14,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2021-12-27 23:46:14,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,147 INFO L387 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 51 treesize of output 37 [2021-12-27 23:46:14,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-12-27 23:46:14,165 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:14,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 62 [2021-12-27 23:46:14,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2021-12-27 23:46:14,328 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-12-27 23:46:14,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 45 [2021-12-27 23:46:14,342 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-27 23:46:14,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2021-12-27 23:46:14,434 INFO L353 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-27 23:46:14,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2021-12-27 23:46:14,442 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:14,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2021-12-27 23:46:14,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-27 23:46:14,621 WARN L860 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_982 (Array Int Int)) (|chain_node_~node~0#1.offset| Int) (v_ArrVal_983 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_982 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_982) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) |c_#memory_$Pointer$.base|) (= (let ((.cse1 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_983 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_983) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse1 |c_chain_node_#in~ppnode#1.base| (store (select .cse1 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.offset|))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2021-12-27 23:46:14,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,717 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-12-27 23:46:14,717 INFO L387 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 2 case distinctions, treesize of input 49 treesize of output 57 [2021-12-27 23:46:14,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:14,749 INFO L353 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2021-12-27 23:46:14,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 88 [2021-12-27 23:46:14,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-27 23:46:14,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-27 23:46:14,777 INFO L353 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2021-12-27 23:46:14,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-27 23:46:14,801 INFO L387 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 69 treesize of output 54 [2021-12-27 23:46:15,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2021-12-27 23:46:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:15,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:15,886 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:46:15,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 129 [2021-12-27 23:46:48,822 INFO L353 Elim1Store]: treesize reduction 136, result has 19.5 percent of original size [2021-12-27 23:46:48,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 140 treesize of output 93 [2021-12-27 23:46:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-27 23:46:48,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:49,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.offset_10| Int) (|v_chain_node_~node~0#1.base_10| Int) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_10|) 0)) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_10| (store v_ArrVal_1012 |v_chain_node_~node~0#1.offset_10| (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_10| v_ArrVal_1012) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| |v_chain_node_~node~0#1.base_10|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_10| (store v_ArrVal_1013 |v_chain_node_~node~0#1.offset_10| (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_10| v_ArrVal_1013) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| |v_chain_node_~node~0#1.offset_10|))) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) 0)) (not (< |v_chain_node_~node~0#1.base_10| |c_#StackHeapBarrier|)))) is different from false [2021-12-27 23:46:49,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886560688] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:49,206 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:49,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2021-12-27 23:46:49,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580086102] [2021-12-27 23:46:49,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:49,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-27 23:46:49,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-27 23:46:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1290, Unknown=18, NotChecked=146, Total=1560 [2021-12-27 23:46:49,208 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 39 states, 31 states have (on average 2.193548387096774) internal successors, (68), 34 states have internal predecessors, (68), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 23:46:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:50,933 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2021-12-27 23:46:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-27 23:46:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.193548387096774) internal successors, (68), 34 states have internal predecessors, (68), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2021-12-27 23:46:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:50,934 INFO L225 Difference]: With dead ends: 145 [2021-12-27 23:46:50,934 INFO L226 Difference]: Without dead ends: 142 [2021-12-27 23:46:50,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=194, Invalid=2246, Unknown=18, NotChecked=194, Total=2652 [2021-12-27 23:46:50,936 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 140 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:50,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 1132 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1319 Invalid, 0 Unknown, 495 Unchecked, 0.9s Time] [2021-12-27 23:46:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-27 23:46:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2021-12-27 23:46:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 100 states have internal predecessors, (111), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-27 23:46:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2021-12-27 23:46:50,950 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 46 [2021-12-27 23:46:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:50,951 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2021-12-27 23:46:50,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.193548387096774) internal successors, (68), 34 states have internal predecessors, (68), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 23:46:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2021-12-27 23:46:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-27 23:46:50,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:50,952 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:50,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:51,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:51,154 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1320962275, now seen corresponding path program 1 times [2021-12-27 23:46:51,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:51,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562827216] [2021-12-27 23:46:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:51,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-27 23:46:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 23:46:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 23:46:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-27 23:46:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 23:46:51,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:51,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562827216] [2021-12-27 23:46:51,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562827216] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:51,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501184132] [2021-12-27 23:46:51,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:51,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:51,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:51,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:51,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-27 23:46:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:52,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-27 23:46:52,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:52,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-27 23:46:52,271 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-27 23:46:52,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-27 23:46:52,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:52,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:46:52,296 INFO L387 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 27 treesize of output 19 [2021-12-27 23:46:52,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-27 23:46:52,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-27 23:46:52,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-12-27 23:46:52,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-27 23:46:52,591 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1404 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1405) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1404) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$.base|) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2021-12-27 23:46:52,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:52,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:52,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:52,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-27 23:46:52,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2021-12-27 23:46:52,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-27 23:46:52,827 WARN L860 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_1408 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1408) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1409)))) is different from true [2021-12-27 23:46:52,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:52,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:52,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:52,852 INFO L387 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 51 treesize of output 47 [2021-12-27 23:46:52,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-27 23:46:52,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-12-27 23:46:52,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:52,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2021-12-27 23:46:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2021-12-27 23:46:52,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:53,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_13| Int) (v_ArrVal_1419 (Array Int Int)) (v_ArrVal_1418 (Array Int Int))) (or (not (< |v_chain_node_~node~0#1.base_13| |c_#StackHeapBarrier|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_13| (store v_ArrVal_1419 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_13| v_ArrVal_1419) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_1418) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|) 0)))) is different from false [2021-12-27 23:46:53,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501184132] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:53,074 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:53,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 30 [2021-12-27 23:46:53,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890902479] [2021-12-27 23:46:53,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:53,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-27 23:46:53,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-27 23:46:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=671, Unknown=4, NotChecked=162, Total=930 [2021-12-27 23:46:53,075 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 7 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-27 23:46:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:54,390 INFO L93 Difference]: Finished difference Result 181 states and 221 transitions. [2021-12-27 23:46:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-27 23:46:54,392 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 7 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2021-12-27 23:46:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:54,393 INFO L225 Difference]: With dead ends: 181 [2021-12-27 23:46:54,393 INFO L226 Difference]: Without dead ends: 178 [2021-12-27 23:46:54,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=1386, Unknown=7, NotChecked=234, Total=1806 [2021-12-27 23:46:54,394 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 106 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:54,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 804 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1329 Invalid, 0 Unknown, 429 Unchecked, 0.9s Time] [2021-12-27 23:46:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-27 23:46:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 128. [2021-12-27 23:46:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 111 states have internal predecessors, (125), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-27 23:46:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2021-12-27 23:46:54,404 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 49 [2021-12-27 23:46:54,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:54,404 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2021-12-27 23:46:54,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 7 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-27 23:46:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2021-12-27 23:46:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-27 23:46:54,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:54,405 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:54,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:54,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:54,619 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2055778686, now seen corresponding path program 1 times [2021-12-27 23:46:54,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:54,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229342053] [2021-12-27 23:46:54,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:54,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-27 23:46:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:54,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 23:46:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:54,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 23:46:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:56,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-27 23:46:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 23:46:56,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:56,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229342053] [2021-12-27 23:46:56,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229342053] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:56,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351037437] [2021-12-27 23:46:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:56,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:56,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:56,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:56,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-27 23:46:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:56,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 193 conjunts are in the unsatisfiable core [2021-12-27 23:46:56,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:56,546 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:56,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-12-27 23:46:56,690 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-27 23:46:56,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 36 treesize of output 51 [2021-12-27 23:46:56,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:56,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-27 23:46:56,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-27 23:46:56,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-12-27 23:46:57,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:57,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:46:57,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:57,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:58,146 INFO L353 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2021-12-27 23:46:58,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2021-12-27 23:47:00,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 78 treesize of output 43 [2021-12-27 23:47:00,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2021-12-27 23:47:00,678 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:47:00,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2021-12-27 23:47:00,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:47:00,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 32 [2021-12-27 23:47:00,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:00,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2021-12-27 23:47:00,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-27 23:47:01,014 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1753 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_1748 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1748) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1753)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_1749 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_1749) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2021-12-27 23:47:01,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,093 INFO L353 Elim1Store]: treesize reduction 52, result has 8.8 percent of original size [2021-12-27 23:47:01,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 89 [2021-12-27 23:47:01,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:01,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2021-12-27 23:47:01,118 INFO L387 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 33 treesize of output 26 [2021-12-27 23:47:01,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:47:01,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-12-27 23:47:01,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-27 23:47:01,151 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-27 23:47:01,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-27 23:47:04,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:04,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:47:04,412 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:47:04,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 77 [2021-12-27 23:47:04,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:04,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:04,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:04,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:04,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:04,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:47:04,434 INFO L353 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2021-12-27 23:47:04,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 36 [2021-12-27 23:47:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-27 23:47:04,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:47:08,036 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (|v_chain_node_~node~0#1.base_17| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_17| (store v_ArrVal_1778 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_17| v_ArrVal_1778) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_1779))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_17| (store v_ArrVal_1777 0 (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_17| v_ArrVal_1777) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0)))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (or (not (< |v_chain_node_~node~0#1.base_17| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|))) (let ((.cse5 (+ .cse1 4))) (and (= (select (select .cse3 .cse4) .cse5) 0) (= (select .cse0 .cse5) 0))) (not (= 0 (select |c_#valid| |v_chain_node_~node~0#1.base_17|)))))))) is different from false [2021-12-27 23:47:08,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351037437] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:47:08,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:47:08,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 38 [2021-12-27 23:47:08,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338283519] [2021-12-27 23:47:08,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:47:08,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-27 23:47:08,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:47:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-27 23:47:08,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1647, Unknown=3, NotChecked=166, Total=1980 [2021-12-27 23:47:08,040 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 38 states, 32 states have (on average 2.46875) internal successors, (79), 34 states have internal predecessors, (79), 8 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8)