./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 791161d1 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-?-791161d [2022-07-22 14:35:26,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:35:26,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:35:26,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:35:26,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:35:26,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:35:26,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:35:26,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:35:26,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:35:26,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:35:26,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:35:26,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:35:26,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:35:26,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:35:26,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:35:26,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:35:26,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:35:26,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:35:26,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:35:26,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:35:26,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:35:26,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:35:26,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:35:26,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:35:26,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:35:26,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:35:26,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:35:26,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:35:26,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:35:26,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:35:26,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:35:26,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:35:26,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:35:26,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:35:26,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:35:26,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:35:26,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:35:26,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:35:26,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:35:26,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:35:26,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:35:26,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:35:26,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:35:26,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:35:26,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:35:26,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:35:26,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:35:26,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:35:26,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:35:26,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:35:26,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:35:26,934 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:35:26,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:35:26,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:35:26,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:35:26,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:35:26,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:35:26,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:35:26,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:35:26,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:35:26,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:35:26,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:35:26,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:35:26,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:35:26,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:35:26,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:35:26,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:35:26,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:35:26,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:35:26,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:35:26,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:35:26,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:35:26,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:35:26,940 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:35:26,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:35:26,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:35:26,940 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 [2022-07-22 14:35:27,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:35:27,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:35:27,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:35:27,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:35:27,174 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:35:27,175 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 [2022-07-22 14:35:27,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3095afdff/39873529f1474afc9eb386c7e301e67d/FLAGa03e96b21 [2022-07-22 14:35:27,658 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:35:27,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2022-07-22 14:35:27,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3095afdff/39873529f1474afc9eb386c7e301e67d/FLAGa03e96b21 [2022-07-22 14:35:27,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3095afdff/39873529f1474afc9eb386c7e301e67d [2022-07-22 14:35:27,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:35:27,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:35:27,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:35:27,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:35:27,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:35:27,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:35:27" (1/1) ... [2022-07-22 14:35:27,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249c142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:27, skipping insertion in model container [2022-07-22 14:35:27,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:35:27" (1/1) ... [2022-07-22 14:35:27,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:35:27,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:35:27,957 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] [2022-07-22 14:35:28,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:35:28,009 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:35:28,048 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] [2022-07-22 14:35:28,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:35:28,093 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:35:28,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28 WrapperNode [2022-07-22 14:35:28,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:35:28,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:35:28,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:35:28,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:35:28,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,138 INFO L137 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 200 [2022-07-22 14:35:28,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:35:28,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:35:28,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:35:28,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:35:28,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:35:28,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:35:28,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:35:28,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:35:28,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (1/1) ... [2022-07-22 14:35:28,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:35:28,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:35:28,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:35:28,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:35:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-22 14:35:28,235 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-22 14:35:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-07-22 14:35:28,236 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-07-22 14:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:35:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:35:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-07-22 14:35:28,237 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-07-22 14:35:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:35:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-07-22 14:35:28,237 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-07-22 14:35:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:35:28,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:35:28,331 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:35:28,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:35:28,625 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:35:28,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:35:28,631 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-22 14:35:28,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:35:28 BoogieIcfgContainer [2022-07-22 14:35:28,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:35:28,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:35:28,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:35:28,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:35:28,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:35:27" (1/3) ... [2022-07-22 14:35:28,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfef8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:35:28, skipping insertion in model container [2022-07-22 14:35:28,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:35:28" (2/3) ... [2022-07-22 14:35:28,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfef8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:35:28, skipping insertion in model container [2022-07-22 14:35:28,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:35:28" (3/3) ... [2022-07-22 14:35:28,643 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2022-07-22 14:35:28,655 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:35:28,655 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:35:28,737 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:35:28,746 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@495e3ae8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1bd88b25 [2022-07-22 14:35:28,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:35:28,760 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) [2022-07-22 14:35:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:35:28,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:35:28,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:35:28,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:35:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:35:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1660370747, now seen corresponding path program 1 times [2022-07-22 14:35:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:35:28,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758020512] [2022-07-22 14:35:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:35:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:35:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:35:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:35:28,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758020512] [2022-07-22 14:35:28,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758020512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:35:28,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:35:28,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:35:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274019302] [2022-07-22 14:35:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:35:28,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:35:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:35:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:35:29,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:35:29,014 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) [2022-07-22 14:35:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:35:29,065 INFO L93 Difference]: Finished difference Result 188 states and 326 transitions. [2022-07-22 14:35:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:35:29,067 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 [2022-07-22 14:35:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:35:29,075 INFO L225 Difference]: With dead ends: 188 [2022-07-22 14:35:29,076 INFO L226 Difference]: Without dead ends: 88 [2022-07-22 14:35:29,082 INFO L412 NwaCegarLoop]: 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 [2022-07-22 14:35:29,085 INFO L413 NwaCegarLoop]: 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 [2022-07-22 14:35:29,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:35:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-22 14:35:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-22 14:35:29,134 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) [2022-07-22 14:35:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-07-22 14:35:29,142 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 16 [2022-07-22 14:35:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:35:29,143 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-07-22 14:35:29,144 INFO L496 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) [2022-07-22 14:35:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-07-22 14:35:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 14:35:29,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:35:29,146 INFO L195 NwaCegarLoop]: 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] [2022-07-22 14:35:29,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:35:29,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:35:29,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:35:29,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1299807145, now seen corresponding path program 1 times [2022-07-22 14:35:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:35:29,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898754032] [2022-07-22 14:35:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:35:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:35:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:35:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:29,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:35:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:35:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:35:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:35:30,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898754032] [2022-07-22 14:35:30,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898754032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:35:30,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324692079] [2022-07-22 14:35:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:35:30,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:35:30,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:35:30,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:35:30,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:35:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:30,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-22 14:35:30,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:35:30,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-22 14:35:30,541 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:35:30,543 INFO L390 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 74 [2022-07-22 14:35:30,549 INFO L390 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 [2022-07-22 14:35:30,562 INFO L390 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 [2022-07-22 14:35:30,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:35:30,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2022-07-22 14:35:30,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:35:30,636 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_3 |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (not (= .cse0 0)) (not (= .cse0 |c_chain_node_#in~ppnode#1.base|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse1 |c_chain_node_#in~ppnode#1.base|) (not (= .cse1 0))))) is different from true [2022-07-22 14:35:30,654 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_3 |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (not (= .cse0 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse1 |c_chain_node_#in~ppnode#1.base|) (not (= .cse1 0))))) is different from true [2022-07-22 14:35:30,865 INFO L356 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-07-22 14:35:30,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 86 [2022-07-22 14:35:30,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:35:30,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-22 14:35:30,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-22 14:35:31,069 WARN L855 $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 [2022-07-22 14:35:31,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:31,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:31,123 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-22 14:35:31,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2022-07-22 14:35:31,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-22 14:35:31,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:35:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-22 14:35:31,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:35:31,280 WARN L833 $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 [2022-07-22 14:35:31,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324692079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:35:31,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:35:31,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 26 [2022-07-22 14:35:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843926013] [2022-07-22 14:35:31,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:35:31,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 14:35:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:35:31,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 14:35:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=443, Unknown=6, NotChecked=180, Total=702 [2022-07-22 14:35:31,287 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 26 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 14:35:31,482 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| .cse10 .cse9))) (let ((.cse6 (@diff .cse8 |c_#memory_$Pointer$.base|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse0 (store .cse8 .cse6 .cse7))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (.cse1 (@diff .cse0 |c_#memory_$Pointer$.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse5 (not (= .cse4 0)))) (and (or (= |c_#memory_$Pointer$.base| .cse0) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (and (not (= (select .cse2 |c_chain_node_#in~ppnode#1.offset|) 0)) (= .cse1 |c_chain_node_#in~ppnode#1.base|))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_3 |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (not (= .cse3 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_3) .cse3) (select |c_#memory_$Pointer$.base| .cse3))))) (and (= .cse4 |c_chain_node_#in~ppnode#1.base|) .cse5)) (= |c_#memory_$Pointer$.base| (store .cse0 .cse1 .cse2)) (or (and (= .cse6 |c_chain_node_#in~ppnode#1.base|) (not (= (select .cse7 |c_chain_node_#in~ppnode#1.offset|) 0))) (= |c_#memory_$Pointer$.base| .cse8) (<= (+ .cse6 1) |c_#StackHeapBarrier|)) .cse5 (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|))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (and (not (= (select .cse9 |c_chain_node_#in~ppnode#1.offset|) 0)) (= .cse10 |c_chain_node_#in~ppnode#1.base|)) (<= (+ .cse10 1) |c_#StackHeapBarrier|))))))))))) is different from true [2022-07-22 14:35:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:35:32,195 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2022-07-22 14:35:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 14:35:32,195 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-07-22 14:35:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:35:32,198 INFO L225 Difference]: With dead ends: 147 [2022-07-22 14:35:32,198 INFO L226 Difference]: Without dead ends: 144 [2022-07-22 14:35:32,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=664, Unknown=7, NotChecked=280, Total=1056 [2022-07-22 14:35:32,200 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 98 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 14:35:32,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 725 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1084 Invalid, 0 Unknown, 621 Unchecked, 0.7s Time] [2022-07-22 14:35:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-22 14:35:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2022-07-22 14:35:32,216 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) [2022-07-22 14:35:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2022-07-22 14:35:32,217 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 40 [2022-07-22 14:35:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:35:32,218 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2022-07-22 14:35:32,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-22 14:35:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2022-07-22 14:35:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 14:35:32,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:35:32,220 INFO L195 NwaCegarLoop]: 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] [2022-07-22 14:35:32,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:35:32,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:35:32,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:35:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:35:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash -727961485, now seen corresponding path program 1 times [2022-07-22 14:35:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:35:32,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883650022] [2022-07-22 14:35:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:35:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:35:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:35:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:35:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:35:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 14:35:33,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:35:33,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883650022] [2022-07-22 14:35:33,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883650022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:35:33,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789508513] [2022-07-22 14:35:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:35:33,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:35:33,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:35:33,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:35:33,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:35:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:33,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-22 14:35:33,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:35:33,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 14:35:33,276 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:35:33,278 INFO L390 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 74 [2022-07-22 14:35:33,285 INFO L390 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 [2022-07-22 14:35:33,290 INFO L390 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 [2022-07-22 14:35:33,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:35:33,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2022-07-22 14:35:33,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:35:33,335 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse0 |c_chain_node_#in~ppnode#1.base|) (not (= .cse0 0)))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_6 |c_chain_node_#in~ppnode#1.offset|))) (and (not (= .cse1 |c_chain_node_#in~ppnode#1.base|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse1 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (not (= .cse1 0)))))) is different from true [2022-07-22 14:35:33,370 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse0 |c_chain_node_#in~ppnode#1.base|) (not (= .cse0 0)))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_6 |c_chain_node_#in~ppnode#1.offset|))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse1 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (not (= .cse1 0)))))) is different from true [2022-07-22 14:35:33,554 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-22 14:35:33,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 94 [2022-07-22 14:35:33,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:35:33,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-22 14:35:33,657 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:35:33,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 8 [2022-07-22 14:35:33,752 WARN L855 $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 [2022-07-22 14:35:33,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:33,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:33,816 INFO L356 Elim1Store]: treesize reduction 43, result has 47.6 percent of original size [2022-07-22 14:35:33,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 57 [2022-07-22 14:35:33,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-22 14:35:33,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:35:33,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2022-07-22 14:35:33,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-22 14:35:34,089 WARN L855 $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 [2022-07-22 14:35:34,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:34,148 INFO L356 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2022-07-22 14:35:34,149 INFO L390 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 101 [2022-07-22 14:35:34,155 INFO L390 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 [2022-07-22 14:35:34,174 INFO L390 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 [2022-07-22 14:35:34,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:34,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-07-22 14:35:34,210 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-07-22 14:35:34,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 54 [2022-07-22 14:35:34,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-07-22 14:35:40,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:35:40,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 762 treesize of output 574 [2022-07-22 14:35:40,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 503 treesize of output 441 [2022-07-22 14:35:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-07-22 14:35:40,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:35:40,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789508513] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:35:40,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:35:40,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 31 [2022-07-22 14:35:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073590555] [2022-07-22 14:35:40,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:35:40,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 14:35:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:35:40,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 14:35:40,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=661, Unknown=19, NotChecked=220, Total=992 [2022-07-22 14:35:40,349 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 31 states, 24 states have (on average 2.25) internal successors, (54), 28 states have internal predecessors, (54), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:35:41,104 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (let ((.cse1 (not (= .cse0 0)))) (and (or (and (= .cse0 |c_chain_node_#in~ppnode#1.base|) .cse1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_6 |c_chain_node_#in~ppnode#1.offset|))) (and (not (= .cse2 |c_chain_node_#in~ppnode#1.base|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse2 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (not (= .cse2 0)))))) .cse1))) is different from true [2022-07-22 14:35:41,134 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (let ((.cse1 (not (= .cse0 0)))) (and (or (and (= .cse0 |c_chain_node_#in~ppnode#1.base|) .cse1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_6 |c_chain_node_#in~ppnode#1.offset|))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse2 v_DerPreprocessor_5) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_6) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (not (= .cse2 0)))))) .cse1))) is different from true [2022-07-22 14:35:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:35:41,723 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2022-07-22 14:35:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 14:35:41,724 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 2.25) internal successors, (54), 28 states have internal predecessors, (54), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-22 14:35:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:35:41,725 INFO L225 Difference]: With dead ends: 137 [2022-07-22 14:35:41,725 INFO L226 Difference]: Without dead ends: 134 [2022-07-22 14:35:41,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=174, Invalid=1378, Unknown=32, NotChecked=486, Total=2070 [2022-07-22 14:35:41,727 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 177 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 632 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 14:35:41,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 821 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1040 Invalid, 0 Unknown, 632 Unchecked, 0.8s Time] [2022-07-22 14:35:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-22 14:35:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2022-07-22 14:35:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 104 states have internal predecessors, (115), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-22 14:35:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2022-07-22 14:35:41,740 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 42 [2022-07-22 14:35:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:35:41,740 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2022-07-22 14:35:41,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 2.25) internal successors, (54), 28 states have internal predecessors, (54), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:35:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2022-07-22 14:35:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 14:35:41,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:35:41,742 INFO L195 NwaCegarLoop]: 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] [2022-07-22 14:35:41,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:35:41,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-22 14:35:41,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:35:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:35:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1343975071, now seen corresponding path program 1 times [2022-07-22 14:35:41,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:35:41,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496311736] [2022-07-22 14:35:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:35:41,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:35:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:35:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:35:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:35:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:35:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:35:43,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496311736] [2022-07-22 14:35:43,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496311736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:35:43,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112556287] [2022-07-22 14:35:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:35:43,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:35:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:35:43,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:35:43,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 14:35:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:35:43,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 139 conjunts are in the unsatisfiable core [2022-07-22 14:35:43,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:35:43,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-07-22 14:35:44,003 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:35:44,004 INFO L390 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 74 [2022-07-22 14:35:44,008 INFO L390 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 [2022-07-22 14:35:44,013 INFO L390 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 [2022-07-22 14:35:44,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:35:44,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:35:44,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2022-07-22 14:35:44,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:35:44,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-22 14:35:44,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:35:44,318 INFO L390 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 [2022-07-22 14:35:44,492 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:35:44,493 INFO L390 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 74 [2022-07-22 14:35:44,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:35:44,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:35:44,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 51 [2022-07-22 14:35:44,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-07-22 14:35:44,593 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-22 14:35:44,594 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 29 [2022-07-22 14:35:46,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:46,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2022-07-22 14:35:46,781 INFO L390 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 14 treesize of output 13 [2022-07-22 14:35:46,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-22 14:35:47,038 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-07-22 14:35:47,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 64 [2022-07-22 14:35:47,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,072 INFO L356 Elim1Store]: treesize reduction 19, result has 42.4 percent of original size [2022-07-22 14:35:47,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 57 [2022-07-22 14:35:47,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:35:47,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:35:47,214 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-22 14:35:47,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2022-07-22 14:35:47,226 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:35:47,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2022-07-22 14:35:47,230 INFO L390 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 [2022-07-22 14:35:47,403 WARN L855 $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 [2022-07-22 14:35:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,478 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-22 14:35:47,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 57 [2022-07-22 14:35:47,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:35:47,516 INFO L356 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-07-22 14:35:47,516 INFO L390 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 [2022-07-22 14:35:47,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-22 14:35:47,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-22 14:35:47,567 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-22 14:35:47,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-22 14:35:47,598 INFO L390 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 25 treesize of output 20 [2022-07-22 14:35:47,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2022-07-22 14:35:47,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-22 14:35:47,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 115 [2022-07-22 14:35:48,259 INFO L356 Elim1Store]: treesize reduction 16, result has 82.8 percent of original size [2022-07-22 14:35:48,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 241 [2022-07-22 14:35:59,438 INFO L356 Elim1Store]: treesize reduction 80, result has 79.8 percent of original size [2022-07-22 14:35:59,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 190 treesize of output 406 [2022-07-22 14:36:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-22 14:36:10,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:11,131 WARN L833 $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 [2022-07-22 14:36:11,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112556287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:11,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:36:11,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2022-07-22 14:36:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611348722] [2022-07-22 14:36:11,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:11,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 14:36:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 14:36:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=8, NotChecked=146, Total=1560 [2022-07-22 14:36:11,136 INFO L87 Difference]: Start difference. First operand 122 states and 150 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) [2022-07-22 14:36:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:13,198 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-07-22 14:36:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 14:36:13,199 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 [2022-07-22 14:36:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:13,200 INFO L225 Difference]: With dead ends: 164 [2022-07-22 14:36:13,200 INFO L226 Difference]: Without dead ends: 161 [2022-07-22 14:36:13,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=198, Invalid=2352, Unknown=8, NotChecked=198, Total=2756 [2022-07-22 14:36:13,202 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 90 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:13,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1134 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1105 Invalid, 0 Unknown, 445 Unchecked, 0.9s Time] [2022-07-22 14:36:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-22 14:36:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2022-07-22 14:36:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 112 states have internal predecessors, (123), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 14:36:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-07-22 14:36:13,233 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 46 [2022-07-22 14:36:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:13,234 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-07-22 14:36:13,234 INFO L496 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) [2022-07-22 14:36:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-07-22 14:36:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 14:36:13,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:13,235 INFO L195 NwaCegarLoop]: 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] [2022-07-22 14:36:13,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 14:36:13,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:13,452 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1320962275, now seen corresponding path program 1 times [2022-07-22 14:36:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:13,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860559607] [2022-07-22 14:36:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:13,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:36:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:36:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:36:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:14,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 14:36:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:36:14,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:14,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860559607] [2022-07-22 14:36:14,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860559607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:14,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050235037] [2022-07-22 14:36:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:14,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:14,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:14,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:14,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 14:36:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:14,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-22 14:36:14,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:14,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-22 14:36:14,662 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:36:14,663 INFO L390 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 74 [2022-07-22 14:36:14,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2022-07-22 14:36:14,672 INFO L390 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 [2022-07-22 14:36:14,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:36:14,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2022-07-22 14:36:14,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:36:14,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-22 14:36:14,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-22 14:36:15,076 WARN L855 $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 [2022-07-22 14:36:15,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:15,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:15,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-22 14:36:15,114 INFO L390 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 [2022-07-22 14:36:15,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-22 14:36:15,340 WARN L855 $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 [2022-07-22 14:36:15,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:15,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:15,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:15,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-07-22 14:36:15,368 INFO L390 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 [2022-07-22 14:36:15,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-07-22 14:36:15,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:15,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-22 14:36:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2022-07-22 14:36:15,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:15,596 WARN L833 $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 [2022-07-22 14:36:15,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050235037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:15,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:36:15,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 30 [2022-07-22 14:36:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288828069] [2022-07-22 14:36:15,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:15,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-22 14:36:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:15,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-22 14:36:15,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=671, Unknown=4, NotChecked=162, Total=930 [2022-07-22 14:36:15,599 INFO L87 Difference]: Start difference. First operand 131 states and 160 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) [2022-07-22 14:36:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:16,871 INFO L93 Difference]: Finished difference Result 181 states and 222 transitions. [2022-07-22 14:36:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 14:36:16,872 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 [2022-07-22 14:36:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:16,873 INFO L225 Difference]: With dead ends: 181 [2022-07-22 14:36:16,873 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 14:36:16,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=1314, Unknown=7, NotChecked=228, Total=1722 [2022-07-22 14:36:16,874 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 150 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:16,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 770 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1265 Invalid, 0 Unknown, 442 Unchecked, 0.9s Time] [2022-07-22 14:36:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 14:36:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 143. [2022-07-22 14:36:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 123 states have internal predecessors, (137), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 14:36:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2022-07-22 14:36:16,889 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 49 [2022-07-22 14:36:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:16,890 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2022-07-22 14:36:16,890 INFO L496 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) [2022-07-22 14:36:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2022-07-22 14:36:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 14:36:16,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:16,892 INFO L195 NwaCegarLoop]: 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] [2022-07-22 14:36:16,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:17,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:17,111 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2055778686, now seen corresponding path program 1 times [2022-07-22 14:36:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:17,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178598646] [2022-07-22 14:36:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:36:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:36:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:36:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 14:36:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:36:18,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:18,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178598646] [2022-07-22 14:36:18,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178598646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:18,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942843412] [2022-07-22 14:36:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:18,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:18,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:18,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:18,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 14:36:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:18,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-22 14:36:18,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:19,026 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:36:19,027 INFO L390 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 [2022-07-22 14:36:19,199 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:36:19,199 INFO L390 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 74 [2022-07-22 14:36:19,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:36:19,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:36:19,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-22 14:36:19,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:36:19,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-22 14:36:19,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 14:36:19,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:36:19,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:19,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 14:36:20,570 INFO L356 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2022-07-22 14:36:20,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2022-07-22 14:36:22,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,141 INFO L390 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 82 treesize of output 43 [2022-07-22 14:36:22,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:22,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 54 [2022-07-22 14:36:22,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,343 INFO L390 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 56 treesize of output 56 [2022-07-22 14:36:22,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:22,469 INFO L390 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 65 treesize of output 36 [2022-07-22 14:36:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,479 INFO L390 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 44 treesize of output 16 [2022-07-22 14:36:22,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:36:22,689 WARN L855 $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 [2022-07-22 14:36:22,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,771 INFO L356 Elim1Store]: treesize reduction 52, result has 8.8 percent of original size [2022-07-22 14:36:22,772 INFO L390 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 101 treesize of output 93 [2022-07-22 14:36:22,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:22,791 INFO L390 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 73 treesize of output 67 [2022-07-22 14:36:22,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-22 14:36:22,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-22 14:36:22,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:36:22,834 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:36:22,835 INFO L390 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 [2022-07-22 14:36:22,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-22 14:36:24,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:24,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:36:24,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:24,757 INFO L390 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 122 treesize of output 70 [2022-07-22 14:36:24,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:24,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:24,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:24,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:24,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:24,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:24,776 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-22 14:36:24,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 33 [2022-07-22 14:36:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-22 14:36:24,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:28,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942843412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:28,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:36:28,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 38 [2022-07-22 14:36:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246336117] [2022-07-22 14:36:28,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:28,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-22 14:36:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:28,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-22 14:36:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1729, Unknown=1, NotChecked=84, Total=1980 [2022-07-22 14:36:28,282 INFO L87 Difference]: Start difference. First operand 143 states and 174 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) [2022-07-22 14:36:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:42,044 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2022-07-22 14:36:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 14:36:42,045 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 50 [2022-07-22 14:36:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:42,046 INFO L225 Difference]: With dead ends: 162 [2022-07-22 14:36:42,047 INFO L226 Difference]: Without dead ends: 159 [2022-07-22 14:36:42,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=294, Invalid=2900, Unknown=2, NotChecked=110, Total=3306 [2022-07-22 14:36:42,048 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 88 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:42,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 837 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 819 Invalid, 0 Unknown, 410 Unchecked, 0.8s Time] [2022-07-22 14:36:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-22 14:36:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2022-07-22 14:36:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 115 states have (on average 1.2173913043478262) internal successors, (140), 125 states have internal predecessors, (140), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-22 14:36:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2022-07-22 14:36:42,072 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 50 [2022-07-22 14:36:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:42,072 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2022-07-22 14:36:42,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-07-22 14:36:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2022-07-22 14:36:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 14:36:42,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:42,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:36:42,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:42,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:42,302 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:42,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1969592115, now seen corresponding path program 1 times [2022-07-22 14:36:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:42,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312356478] [2022-07-22 14:36:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:42,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:36:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:36:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:36:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 14:36:45,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:45,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312356478] [2022-07-22 14:36:45,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312356478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:45,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458237199] [2022-07-22 14:36:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:45,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:45,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:45,246 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:45,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 14:36:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:45,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 189 conjunts are in the unsatisfiable core [2022-07-22 14:36:45,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:45,458 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:36:45,458 INFO L390 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 [2022-07-22 14:36:45,577 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:36:45,577 INFO L390 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 74 [2022-07-22 14:36:45,609 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:36:45,610 INFO L390 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 74 [2022-07-22 14:36:45,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:36:45,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:36:45,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:36:45,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:36:45,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:36:45,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2022-07-22 14:36:45,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:36:45,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-07-22 14:36:45,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:36:45,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-22 14:36:45,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:36:46,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-07-22 14:36:46,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:36:46,058 INFO L390 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 [2022-07-22 14:36:46,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,428 INFO L390 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 33 treesize of output 31 [2022-07-22 14:36:46,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,436 INFO L390 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 36 treesize of output 34 [2022-07-22 14:36:46,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-22 14:36:46,456 INFO L390 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 28 treesize of output 23 [2022-07-22 14:36:46,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-22 14:36:46,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:36:46,691 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-22 14:36:46,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 54 [2022-07-22 14:36:46,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-07-22 14:36:46,835 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 14:36:46,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 29 [2022-07-22 14:36:46,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:46,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2022-07-22 14:36:46,851 INFO L390 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 [2022-07-22 14:36:47,103 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2114 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2114) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2112)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_2110 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2110) |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)))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-22 14:36:47,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,154 INFO L356 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2022-07-22 14:36:47,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2022-07-22 14:36:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:47,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 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 [2022-07-22 14:36:47,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2022-07-22 14:36:47,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-22 14:36:47,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:36:47,198 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:36:47,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:36:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:48,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:48,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:48,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:48,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:48,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:48,502 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:36:48,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 39 [2022-07-22 14:36:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-22 14:36:48,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:49,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458237199] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:49,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:36:49,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2022-07-22 14:36:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511748667] [2022-07-22 14:36:49,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 14:36:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 14:36:49,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2013, Unknown=3, NotChecked=90, Total=2256 [2022-07-22 14:36:49,594 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 40 states, 32 states have (on average 2.28125) internal successors, (73), 35 states have internal predecessors, (73), 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) [2022-07-22 14:36:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:51,372 INFO L93 Difference]: Finished difference Result 256 states and 313 transitions. [2022-07-22 14:36:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 14:36:51,372 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 2.28125) internal successors, (73), 35 states have internal predecessors, (73), 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 50 [2022-07-22 14:36:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:51,374 INFO L225 Difference]: With dead ends: 256 [2022-07-22 14:36:51,374 INFO L226 Difference]: Without dead ends: 186 [2022-07-22 14:36:51,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=226, Invalid=2855, Unknown=3, NotChecked=108, Total=3192 [2022-07-22 14:36:51,376 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:51,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1065 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 981 Invalid, 0 Unknown, 411 Unchecked, 1.0s Time] [2022-07-22 14:36:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-22 14:36:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 167. [2022-07-22 14:36:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 142 states have internal predecessors, (161), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-22 14:36:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2022-07-22 14:36:51,394 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 50 [2022-07-22 14:36:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:51,395 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2022-07-22 14:36:51,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 2.28125) internal successors, (73), 35 states have internal predecessors, (73), 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) [2022-07-22 14:36:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2022-07-22 14:36:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 14:36:51,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:51,396 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-22 14:36:51,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:51,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:51,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1872718035, now seen corresponding path program 1 times [2022-07-22 14:36:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:51,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102431090] [2022-07-22 14:36:51,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:51,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:36:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:36:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:36:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 14:36:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 14:36:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102431090] [2022-07-22 14:36:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102431090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540597292] [2022-07-22 14:36:52,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:52,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:52,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:52,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:52,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 14:36:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:52,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 128 conjunts are in the unsatisfiable core [2022-07-22 14:36:52,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:36:52,726 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:36:52,726 INFO L390 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 74 [2022-07-22 14:36:52,732 INFO L390 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 [2022-07-22 14:36:52,736 INFO L390 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 [2022-07-22 14:36:52,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-22 14:36:52,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:36:52,769 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (not (= .cse0 0)) (not (= .cse0 |c_chain_node_#in~ppnode#1.base|)))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_27 |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)) (= v_DerPreprocessor_26 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_26) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_27) .cse1 v_DerPreprocessor_26) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_27) .cse1)) (not (= .cse1 0)))))) is different from true [2022-07-22 14:36:52,930 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 14:36:52,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2022-07-22 14:36:52,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-07-22 14:36:52,986 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:36:52,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 8 [2022-07-22 14:36:53,094 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2524) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2527) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2022-07-22 14:36:53,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,131 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-22 14:36:53,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-07-22 14:36:53,143 INFO L390 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 16 treesize of output 13 [2022-07-22 14:36:53,160 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-22 14:36:53,267 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-22 14:36:53,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 45 [2022-07-22 14:36:53,379 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-22 14:36:53,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 31 [2022-07-22 14:36:53,443 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2533 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2534) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2533) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-07-22 14:36:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,509 INFO L356 Elim1Store]: treesize reduction 47, result has 44.7 percent of original size [2022-07-22 14:36:53,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 75 [2022-07-22 14:36:53,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-22 14:36:53,540 INFO L390 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 20 treesize of output 15 [2022-07-22 14:36:53,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-22 14:36:53,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:36:53,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-07-22 14:36:53,754 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2535 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_2535 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2535) |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|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2022-07-22 14:36:53,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:36:53,791 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-22 14:36:53,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 62 [2022-07-22 14:36:53,796 INFO L390 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 [2022-07-22 14:36:53,818 INFO L390 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 38 treesize of output 29 [2022-07-22 14:36:53,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2022-07-22 14:36:54,888 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-22 14:36:54,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 47 [2022-07-22 14:36:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2022-07-22 14:36:54,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:36:55,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540597292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:55,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:36:55,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 33 [2022-07-22 14:36:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310606000] [2022-07-22 14:36:55,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:36:55,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 14:36:55,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:36:55,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 14:36:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=764, Unknown=15, NotChecked=236, Total=1122 [2022-07-22 14:36:55,087 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 33 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 30 states have internal predecessors, (61), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-22 14:36:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:36:56,031 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2022-07-22 14:36:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 14:36:56,033 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 30 states have internal predecessors, (61), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 51 [2022-07-22 14:36:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:36:56,034 INFO L225 Difference]: With dead ends: 187 [2022-07-22 14:36:56,034 INFO L226 Difference]: Without dead ends: 184 [2022-07-22 14:36:56,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=183, Invalid=1451, Unknown=22, NotChecked=324, Total=1980 [2022-07-22 14:36:56,035 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 143 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 651 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 14:36:56,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 699 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 640 Invalid, 0 Unknown, 651 Unchecked, 0.5s Time] [2022-07-22 14:36:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-22 14:36:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 167. [2022-07-22 14:36:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.2030075187969924) internal successors, (160), 142 states have internal predecessors, (160), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-22 14:36:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2022-07-22 14:36:56,059 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 51 [2022-07-22 14:36:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:36:56,060 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2022-07-22 14:36:56,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 30 states have internal predecessors, (61), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-22 14:36:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2022-07-22 14:36:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 14:36:56,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:36:56,063 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-22 14:36:56,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 14:36:56,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:56,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:36:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:36:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1808852267, now seen corresponding path program 1 times [2022-07-22 14:36:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:36:56,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490471215] [2022-07-22 14:36:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:36:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:36:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:36:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:36:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 14:36:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:36:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:36:59,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490471215] [2022-07-22 14:36:59,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490471215] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:36:59,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882192484] [2022-07-22 14:36:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:36:59,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:36:59,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:36:59,692 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:36:59,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 14:36:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:36:59,922 WARN L261 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 234 conjunts are in the unsatisfiable core [2022-07-22 14:36:59,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:00,002 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-22 14:37:00,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2022-07-22 14:37:00,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:37:00,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:37:00,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:37:02,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-07-22 14:37:02,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 25 [2022-07-22 14:37:02,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-07-22 14:37:02,068 INFO L390 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 20 treesize of output 25 [2022-07-22 14:37:02,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 21 [2022-07-22 14:37:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-22 14:37:02,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,320 INFO L390 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-07-22 14:37:02,333 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:37:02,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 61 [2022-07-22 14:37:02,467 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:02,468 INFO L390 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 3 case distinctions, treesize of input 61 treesize of output 32 [2022-07-22 14:37:02,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,474 INFO L390 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-22 14:37:02,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:02,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2022-07-22 14:37:02,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,756 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-22 14:37:02,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 69 [2022-07-22 14:37:02,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-07-22 14:37:02,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-07-22 14:37:02,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-22 14:37:02,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 14:37:02,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:02,802 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-07-22 14:37:02,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2022-07-22 14:37:03,091 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-07-22 14:37:03,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 93 [2022-07-22 14:37:03,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,114 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 14:37:03,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 78 [2022-07-22 14:37:03,312 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-22 14:37:03,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 154 treesize of output 68 [2022-07-22 14:37:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,331 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:03,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 19 [2022-07-22 14:37:03,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-22 14:37:03,505 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2894) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2892) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_2891 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2891) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2893) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-22 14:37:03,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,576 INFO L356 Elim1Store]: treesize reduction 110, result has 9.1 percent of original size [2022-07-22 14:37:03,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 218 treesize of output 162 [2022-07-22 14:37:03,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,609 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:03,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-07-22 14:37:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:03,636 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-22 14:37:03,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2022-07-22 14:37:03,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-22 14:37:03,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-22 14:37:03,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-22 14:37:06,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,423 INFO L356 Elim1Store]: treesize reduction 215, result has 6.5 percent of original size [2022-07-22 14:37:06,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 26 case distinctions, treesize of input 249 treesize of output 126 [2022-07-22 14:37:06,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:06,450 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-22 14:37:06,450 INFO L390 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 3 case distinctions, treesize of input 64 treesize of output 36 [2022-07-22 14:37:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2022-07-22 14:37:06,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:08,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882192484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:08,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:37:08,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 40 [2022-07-22 14:37:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502838009] [2022-07-22 14:37:08,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:08,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 14:37:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 14:37:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1890, Unknown=6, NotChecked=88, Total=2162 [2022-07-22 14:37:08,391 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand has 40 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 37 states have internal predecessors, (83), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 14:37:10,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2894) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2892) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_2891 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2891) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2893) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2856 Int) (v_ArrVal_2857 Int)) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (let ((.cse1 (store (store (select |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base|) 0 v_ArrVal_2857) 4 0))) (store .cse1 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| .cse1) |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|)))) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (let ((.cse2 (store (store (select |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base|) 0 v_ArrVal_2856) 4 0))) (store .cse2 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| .cse2) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)))) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2861) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0)))) is different from true [2022-07-22 14:37:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:15,084 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2022-07-22 14:37:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-22 14:37:15,085 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 37 states have internal predecessors, (83), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 53 [2022-07-22 14:37:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:15,086 INFO L225 Difference]: With dead ends: 241 [2022-07-22 14:37:15,086 INFO L226 Difference]: Without dead ends: 238 [2022-07-22 14:37:15,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=302, Invalid=3116, Unknown=12, NotChecked=230, Total=3660 [2022-07-22 14:37:15,088 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 64 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 799 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:15,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1203 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1304 Invalid, 0 Unknown, 799 Unchecked, 1.2s Time] [2022-07-22 14:37:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-22 14:37:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 219. [2022-07-22 14:37:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 175 states have (on average 1.1885714285714286) internal successors, (208), 186 states have internal predecessors, (208), 35 states have call successors, (35), 10 states have call predecessors, (35), 8 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-22 14:37:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2022-07-22 14:37:15,114 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 53 [2022-07-22 14:37:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:15,114 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2022-07-22 14:37:15,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 37 states have internal predecessors, (83), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 14:37:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2022-07-22 14:37:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 14:37:15,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:15,116 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:15,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-22 14:37:15,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-22 14:37:15,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash 830072921, now seen corresponding path program 1 times [2022-07-22 14:37:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:15,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769987644] [2022-07-22 14:37:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:37:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 14:37:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:16,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 14:37:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 14:37:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:37:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:18,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769987644] [2022-07-22 14:37:18,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769987644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:18,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574534566] [2022-07-22 14:37:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:18,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:18,368 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:37:18,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 14:37:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:18,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 176 conjunts are in the unsatisfiable core [2022-07-22 14:37:18,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:18,659 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-22 14:37:18,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2022-07-22 14:37:18,747 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:18,748 INFO L390 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 11 treesize of output 7 [2022-07-22 14:37:18,916 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:37:18,916 INFO L390 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 74 [2022-07-22 14:37:18,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2022-07-22 14:37:18,925 INFO L390 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 [2022-07-22 14:37:18,956 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-07-22 14:37:18,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 34 [2022-07-22 14:37:18,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-22 14:37:19,133 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-22 14:37:19,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 102 [2022-07-22 14:37:19,448 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-22 14:37:19,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 106 [2022-07-22 14:37:19,453 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:37:19,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 14:37:19,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 14:37:19,655 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:37:19,658 INFO L158 Benchmark]: Toolchain (without parser) took 111966.54ms. Allocated memory was 102.8MB in the beginning and 192.9MB in the end (delta: 90.2MB). Free memory was 61.1MB in the beginning and 128.9MB in the end (delta: -67.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-07-22 14:37:19,658 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 79.4MB in the beginning and 79.3MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:37:19,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.94ms. Allocated memory is still 102.8MB. Free memory was 60.8MB in the beginning and 67.6MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:37:19,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.26ms. Allocated memory is still 102.8MB. Free memory was 67.6MB in the beginning and 65.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:37:19,659 INFO L158 Benchmark]: Boogie Preprocessor took 40.15ms. Allocated memory is still 102.8MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:37:19,659 INFO L158 Benchmark]: RCFGBuilder took 453.85ms. Allocated memory is still 102.8MB. Free memory was 63.0MB in the beginning and 42.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-22 14:37:19,659 INFO L158 Benchmark]: TraceAbstraction took 111022.07ms. Allocated memory was 102.8MB in the beginning and 192.9MB in the end (delta: 90.2MB). Free memory was 42.1MB in the beginning and 128.9MB in the end (delta: -86.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-07-22 14:37:19,660 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 79.4MB in the beginning and 79.3MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.94ms. Allocated memory is still 102.8MB. Free memory was 60.8MB in the beginning and 67.6MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.26ms. Allocated memory is still 102.8MB. Free memory was 67.6MB in the beginning and 65.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.15ms. Allocated memory is still 102.8MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.85ms. Allocated memory is still 102.8MB. Free memory was 63.0MB in the beginning and 42.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 111022.07ms. Allocated memory was 102.8MB in the beginning and 192.9MB in the end (delta: 90.2MB). Free memory was 42.1MB in the beginning and 128.9MB in the end (delta: -86.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:37:19,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:37:21,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:37:21,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:37:21,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:37:21,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:37:21,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:37:21,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:37:21,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:37:21,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:37:21,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:37:21,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:37:21,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:37:21,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:37:21,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:37:21,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:37:21,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:37:21,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:37:21,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:37:21,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:37:21,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:37:21,599 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:37:21,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:37:21,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:37:21,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:37:21,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:37:21,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:37:21,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:37:21,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:37:21,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:37:21,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:37:21,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:37:21,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:37:21,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:37:21,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:37:21,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:37:21,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:37:21,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:37:21,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:37:21,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:37:21,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:37:21,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:37:21,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:37:21,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:37:21,660 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:37:21,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:37:21,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:37:21,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:37:21,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:37:21,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:37:21,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:37:21,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:37:21,663 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:37:21,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:37:21,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:37:21,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:37:21,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:37:21,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:37:21,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:37:21,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:37:21,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:37:21,673 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:37:21,673 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:37:21,673 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:37:21,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:37:21,673 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:37:21,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:37:21,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:37:21,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:37:21,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:37:21,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:37:21,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:37:21,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:37:21,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:37:21,675 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:37:21,675 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:37:21,675 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:37:21,675 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:37:21,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:37:21,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:37:21,676 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2022-07-22 14:37:21,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:37:21,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:37:21,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:37:21,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:37:21,998 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:37:21,999 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 [2022-07-22 14:37:22,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51e135c5/9b47a0a8f3e342029eeda366e79a3358/FLAGabcc49f85 [2022-07-22 14:37:22,547 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:37:22,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2022-07-22 14:37:22,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51e135c5/9b47a0a8f3e342029eeda366e79a3358/FLAGabcc49f85 [2022-07-22 14:37:23,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51e135c5/9b47a0a8f3e342029eeda366e79a3358 [2022-07-22 14:37:23,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:37:23,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:37:23,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:37:23,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:37:23,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:37:23,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f1ffdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23, skipping insertion in model container [2022-07-22 14:37:23,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:37:23,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:37:23,331 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] [2022-07-22 14:37:23,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:37:23,393 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:37:23,427 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] [2022-07-22 14:37:23,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:37:23,487 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:37:23,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23 WrapperNode [2022-07-22 14:37:23,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:37:23,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:37:23,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:37:23,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:37:23,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,549 INFO L137 Inliner]: procedures = 130, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 198 [2022-07-22 14:37:23,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:37:23,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:37:23,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:37:23,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:37:23,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:37:23,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:37:23,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:37:23,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:37:23,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (1/1) ... [2022-07-22 14:37:23,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:37:23,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:23,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:37:23,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:37:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-22 14:37:23,692 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-22 14:37:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:37:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:37:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:37:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:37:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:37:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-07-22 14:37:23,694 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-07-22 14:37:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:37:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:37:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:37:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-07-22 14:37:23,695 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-07-22 14:37:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-07-22 14:37:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-07-22 14:37:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:37:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:37:23,872 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:37:23,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:37:24,272 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:37:24,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:37:24,278 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-22 14:37:24,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:37:24 BoogieIcfgContainer [2022-07-22 14:37:24,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:37:24,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:37:24,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:37:24,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:37:24,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:37:23" (1/3) ... [2022-07-22 14:37:24,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81cffdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:37:24, skipping insertion in model container [2022-07-22 14:37:24,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:23" (2/3) ... [2022-07-22 14:37:24,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81cffdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:37:24, skipping insertion in model container [2022-07-22 14:37:24,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:37:24" (3/3) ... [2022-07-22 14:37:24,285 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2022-07-22 14:37:24,301 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:37:24,301 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:37:24,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:37:24,347 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37bffb70, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fe55895 [2022-07-22 14:37:24,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:37:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 79 states have internal predecessors, (123), 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) [2022-07-22 14:37:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:37:24,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:24,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:24,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash -467593890, now seen corresponding path program 1 times [2022-07-22 14:37:24,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:37:24,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014873476] [2022-07-22 14:37:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:37:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:37:24,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:37:24,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:37:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:24,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:37:24,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:24,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:37:24,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:37:24,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014873476] [2022-07-22 14:37:24,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014873476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:37:24,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:37:24,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:37:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756443270] [2022-07-22 14:37:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:37:24,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:37:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:37:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:37:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:37:24,596 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 79 states have internal predecessors, (123), 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) [2022-07-22 14:37:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:24,624 INFO L93 Difference]: Finished difference Result 182 states and 320 transitions. [2022-07-22 14:37:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:37:24,627 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 [2022-07-22 14:37:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:24,636 INFO L225 Difference]: With dead ends: 182 [2022-07-22 14:37:24,637 INFO L226 Difference]: Without dead ends: 85 [2022-07-22 14:37:24,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:37:24,655 INFO L413 NwaCegarLoop]: 112 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, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:24,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:37:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-22 14:37:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-22 14:37:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.25) internal successors, (80), 72 states have internal predecessors, (80), 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) [2022-07-22 14:37:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2022-07-22 14:37:24,708 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 16 [2022-07-22 14:37:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:24,708 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2022-07-22 14:37:24,709 INFO L496 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) [2022-07-22 14:37:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-07-22 14:37:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 14:37:24,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:24,711 INFO L195 NwaCegarLoop]: 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] [2022-07-22 14:37:24,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 14:37:24,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:37:24,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash -485270813, now seen corresponding path program 1 times [2022-07-22 14:37:24,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:37:24,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588832252] [2022-07-22 14:37:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:24,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:37:24,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:37:24,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:37:24,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:37:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:25,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 14:37:25,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:25,502 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-22 14:37:25,503 INFO L390 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 74 [2022-07-22 14:37:25,514 INFO L390 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 [2022-07-22 14:37:25,525 INFO L390 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 [2022-07-22 14:37:25,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-22 14:37:25,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:37:25,793 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 14:37:25,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-22 14:37:25,841 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:25,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 8 [2022-07-22 14:37:26,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:26,604 INFO L356 Elim1Store]: treesize reduction 151, result has 32.9 percent of original size [2022-07-22 14:37:26,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 138 treesize of output 309 [2022-07-22 14:37:27,086 INFO L356 Elim1Store]: treesize reduction 59, result has 33.7 percent of original size [2022-07-22 14:37:27,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 212 [2022-07-22 14:37:28,580 INFO L356 Elim1Store]: treesize reduction 98, result has 8.4 percent of original size [2022-07-22 14:37:28,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 307 treesize of output 341 [2022-07-22 14:37:28,912 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 14:37:28,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 65 [2022-07-22 14:37:29,407 INFO L356 Elim1Store]: treesize reduction 65, result has 28.6 percent of original size [2022-07-22 14:37:29,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1304 treesize of output 1027 [2022-07-22 14:37:29,894 INFO L356 Elim1Store]: treesize reduction 76, result has 39.7 percent of original size [2022-07-22 14:37:29,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 997 treesize of output 1108 [2022-07-22 14:37:30,265 INFO L356 Elim1Store]: treesize reduction 71, result has 11.3 percent of original size [2022-07-22 14:37:30,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 229 [2022-07-22 14:37:30,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:30,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:30,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 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 98 treesize of output 153 [2022-07-22 14:37:32,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 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 112 treesize of output 254 [2022-07-22 14:37:32,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 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 112 treesize of output 269 [2022-07-22 14:37:33,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 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 112 treesize of output 269 [2022-07-22 14:37:33,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:33,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,502 INFO L244 Elim1Store]: Index analysis took 195 ms [2022-07-22 14:37:33,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 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 112 treesize of output 269 [2022-07-22 14:37:33,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:33,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 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 112 treesize of output 254 [2022-07-22 14:37:34,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:34,208 INFO L244 Elim1Store]: Index analysis took 250 ms [2022-07-22 14:37:34,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:34,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:34,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:34,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:34,234 INFO L356 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-07-22 14:37:34,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 112 treesize of output 264 [2022-07-22 14:37:35,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:36,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:36,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:36,047 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-22 14:37:36,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 117 [2022-07-22 14:37:36,172 INFO L356 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2022-07-22 14:37:36,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1137 treesize of output 1048 [2022-07-22 14:37:36,225 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-22 14:37:36,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1062 treesize of output 1022 [2022-07-22 14:37:37,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:37,338 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:37,375 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,448 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:37,449 INFO L390 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 [2022-07-22 14:37:37,545 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:37,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 [2022-07-22 14:37:37,595 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,630 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,675 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,735 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:37,971 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:38,023 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:38,053 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:38,155 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:38,155 INFO L390 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 [2022-07-22 14:37:38,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:38,199 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:38,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:38,267 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 14:37:38,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-22 14:37:38,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-22 14:37:38,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-22 14:37:38,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-22 14:37:38,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:37:38,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588832252] [2022-07-22 14:37:38,905 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:37:38,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:37:39,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:37:39,106 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$.base| (select v_arrayElimCell_14 (_ bv0 32))) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:235) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:207) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:104) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:37:39,111 INFO L158 Benchmark]: Toolchain (without parser) took 16077.65ms. Allocated memory was 52.4MB in the beginning and 92.3MB in the end (delta: 39.8MB). Free memory was 27.6MB in the beginning and 48.5MB in the end (delta: -20.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-07-22 14:37:39,112 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.0MB in the beginning and 33.9MB in the end (delta: 33.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:37:39,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.41ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 27.5MB in the beginning and 36.2MB in the end (delta: -8.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-07-22 14:37:39,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.35ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 33.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:37:39,114 INFO L158 Benchmark]: Boogie Preprocessor took 73.97ms. Allocated memory is still 62.9MB. Free memory was 33.7MB in the beginning and 42.9MB in the end (delta: -9.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-07-22 14:37:39,114 INFO L158 Benchmark]: RCFGBuilder took 654.63ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 36.8MB in the end (delta: 6.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 14:37:39,119 INFO L158 Benchmark]: TraceAbstraction took 14829.08ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 36.4MB in the beginning and 48.5MB in the end (delta: -12.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2022-07-22 14:37:39,121 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.0MB in the beginning and 33.9MB in the end (delta: 33.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.41ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 27.5MB in the beginning and 36.2MB in the end (delta: -8.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.35ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 33.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.97ms. Allocated memory is still 62.9MB. Free memory was 33.7MB in the beginning and 42.9MB in the end (delta: -9.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 654.63ms. Allocated memory is still 62.9MB. Free memory was 42.9MB in the beginning and 36.8MB in the end (delta: 6.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14829.08ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 36.4MB in the beginning and 48.5MB in the end (delta: -12.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$.base| (select v_arrayElimCell_14 (_ bv0 32))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$.base| (select v_arrayElimCell_14 (_ bv0 32))): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:37:39,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$.base| (select v_arrayElimCell_14 (_ bv0 32)))