./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all.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/list-simple/dll2c_remove_all.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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:51:12,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:51:12,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:51:12,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:51:12,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:51:12,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:51:12,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:51:12,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:51:12,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:51:12,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:51:12,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:51:12,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:51:12,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:51:12,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:51:12,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:51:12,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:51:12,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:51:12,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:51:12,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:51:12,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:51:12,665 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:51:12,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:51:12,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:51:12,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:51:12,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:51:12,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:51:12,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:51:12,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:51:12,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:51:12,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:51:12,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:51:12,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:51:12,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:51:12,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:51:12,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:51:12,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:51:12,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:51:12,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:51:12,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:51:12,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:51:12,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:51:12,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:51:12,693 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:51:12,727 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:51:12,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:51:12,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:51:12,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:51:12,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:51:12,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:51:12,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:51:12,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:51:12,731 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:51:12,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:51:12,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:51:12,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:51:12,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:51:12,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:51:12,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:51:12,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:51:12,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:51:12,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:51:12,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:51:12,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:51:12,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:51:12,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:51:12,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:51:12,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:51:12,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:12,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:51:12,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:51:12,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:51:12,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:51:12,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:51:12,741 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:51:12,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:51:12,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:51:12,742 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2022-07-22 14:51:12,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:51:13,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:51:13,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:51:13,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:51:13,014 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:51:13,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-07-22 14:51:13,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bca31d55/80ed022cc2f94381aa205403125d46d2/FLAGa08e09419 [2022-07-22 14:51:13,559 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:51:13,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-07-22 14:51:13,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bca31d55/80ed022cc2f94381aa205403125d46d2/FLAGa08e09419 [2022-07-22 14:51:14,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bca31d55/80ed022cc2f94381aa205403125d46d2 [2022-07-22 14:51:14,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:51:14,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:51:14,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:14,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:51:14,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:51:14,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff8837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14, skipping insertion in model container [2022-07-22 14:51:14,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:51:14,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:51:14,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-07-22 14:51:14,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:14,444 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:51:14,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-07-22 14:51:14,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:14,508 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:51:14,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14 WrapperNode [2022-07-22 14:51:14,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:14,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:14,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:51:14,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:51:14,517 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:51:14" (1/1) ... [2022-07-22 14:51:14,543 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:51:14" (1/1) ... [2022-07-22 14:51:14,571 INFO L137 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2022-07-22 14:51:14,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:14,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:51:14,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:51:14,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:51:14,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:51:14,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:51:14,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:51:14,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:51:14,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (1/1) ... [2022-07-22 14:51:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:14,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:14,661 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:51:14,679 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:51:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:51:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-22 14:51:14,697 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-22 14:51:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:51:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:51:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:51:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:51:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:51:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:51:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:51:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:51:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:51:14,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:51:14,822 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:51:14,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:51:15,050 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:51:15,055 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:51:15,055 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:51:15,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:15 BoogieIcfgContainer [2022-07-22 14:51:15,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:51:15,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:51:15,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:51:15,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:51:15,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:51:14" (1/3) ... [2022-07-22 14:51:15,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ec0c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:15, skipping insertion in model container [2022-07-22 14:51:15,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:14" (2/3) ... [2022-07-22 14:51:15,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ec0c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:15, skipping insertion in model container [2022-07-22 14:51:15,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:15" (3/3) ... [2022-07-22 14:51:15,065 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2022-07-22 14:51:15,078 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:51:15,079 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:51:15,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:51:15,144 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@68985351, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7983431b [2022-07-22 14:51:15,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:51:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:51:15,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:15,165 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:51:15,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1715695268, now seen corresponding path program 1 times [2022-07-22 14:51:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:15,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529364809] [2022-07-22 14:51:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:15,418 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:51:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:15,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529364809] [2022-07-22 14:51:15,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529364809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:15,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:15,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:51:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999383008] [2022-07-22 14:51:15,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:15,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:51:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:15,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:51:15,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:15,452 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:15,500 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-07-22 14:51:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:51:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:51:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:15,508 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:51:15,509 INFO L226 Difference]: Without dead ends: 23 [2022-07-22 14:51:15,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:15,514 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:15,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-22 14:51:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-22 14:51:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 14:51:15,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-22 14:51:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:15,546 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 14:51:15,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 14:51:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:51:15,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:15,548 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:51:15,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:51:15,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1231917993, now seen corresponding path program 1 times [2022-07-22 14:51:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:15,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110950714] [2022-07-22 14:51:15,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:15,682 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:51:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110950714] [2022-07-22 14:51:15,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110950714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:15,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:15,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:51:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910580231] [2022-07-22 14:51:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:15,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:51:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:51:15,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:15,686 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:15,735 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-07-22 14:51:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:51:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:51:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:15,738 INFO L225 Difference]: With dead ends: 37 [2022-07-22 14:51:15,738 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 14:51:15,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:15,744 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:15,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 14:51:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-22 14:51:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 14:51:15,754 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-22 14:51:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:15,756 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 14:51:15,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 14:51:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:51:15,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:15,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:15,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:51:15,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash 899729579, now seen corresponding path program 1 times [2022-07-22 14:51:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:15,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475980517] [2022-07-22 14:51:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:15,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475980517] [2022-07-22 14:51:15,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475980517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:15,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:15,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:51:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080996329] [2022-07-22 14:51:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:15,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:51:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:15,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:51:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:51:15,917 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:15,970 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-22 14:51:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:51:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-22 14:51:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:15,972 INFO L225 Difference]: With dead ends: 31 [2022-07-22 14:51:15,972 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 14:51:15,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:51:15,974 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:15,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 14:51:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-22 14:51:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-22 14:51:15,980 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 26 [2022-07-22 14:51:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:15,980 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 14:51:15,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-22 14:51:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:51:15,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:15,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:15,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:51:15,982 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash 491955104, now seen corresponding path program 1 times [2022-07-22 14:51:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:15,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140462734] [2022-07-22 14:51:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:15,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140462734] [2022-07-22 14:51:16,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140462734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301131674] [2022-07-22 14:51:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:16,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:16,141 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:51:16,143 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:51:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:16,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:51:16,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:16,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:16,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301131674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:51:16,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:51:16,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-22 14:51:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773093361] [2022-07-22 14:51:16,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:16,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 14:51:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 14:51:16,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:51:16,529 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:51:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:16,579 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-07-22 14:51:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:51:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-07-22 14:51:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:16,581 INFO L225 Difference]: With dead ends: 32 [2022-07-22 14:51:16,581 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 14:51:16,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:51:16,582 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:16,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 83 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 14:51:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-22 14:51:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-22 14:51:16,588 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 29 [2022-07-22 14:51:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:16,588 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-22 14:51:16,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:51:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-22 14:51:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:51:16,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:16,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:16,615 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:51:16,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:16,796 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:16,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1349916533, now seen corresponding path program 2 times [2022-07-22 14:51:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:16,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950019361] [2022-07-22 14:51:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:16,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:51:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:16,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950019361] [2022-07-22 14:51:16,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950019361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:16,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:16,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:51:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161256471] [2022-07-22 14:51:16,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:16,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:51:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:16,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:51:16,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:51:16,894 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:16,984 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-07-22 14:51:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:51:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-07-22 14:51:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:16,985 INFO L225 Difference]: With dead ends: 37 [2022-07-22 14:51:16,985 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 14:51:16,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:51:16,987 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:16,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:51:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 14:51:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-22 14:51:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-22 14:51:16,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2022-07-22 14:51:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:16,995 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-22 14:51:16,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-22 14:51:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:51:16,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:16,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:16,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 14:51:16,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1292658231, now seen corresponding path program 1 times [2022-07-22 14:51:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:16,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664689368] [2022-07-22 14:51:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:17,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:51:17,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:17,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664689368] [2022-07-22 14:51:17,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664689368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:17,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617747948] [2022-07-22 14:51:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:17,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:17,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:17,360 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:51:17,392 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:51:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:17,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-22 14:51:17,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:17,572 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:51:17,710 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:51:17,711 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 11 [2022-07-22 14:51:17,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:17,796 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:51:17,800 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 26 treesize of output 27 [2022-07-22 14:51:17,910 INFO L356 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-07-22 14:51:17,911 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 2 case distinctions, treesize of input 58 treesize of output 31 [2022-07-22 14:51:18,048 INFO L356 Elim1Store]: treesize reduction 70, result has 29.3 percent of original size [2022-07-22 14:51:18,048 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 95 treesize of output 51 [2022-07-22 14:51:18,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-22 14:51:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:51:18,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:18,089 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 29 treesize of output 21 [2022-07-22 14:51:19,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) is different from false [2022-07-22 14:51:20,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-07-22 14:51:20,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_728))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-07-22 14:51:20,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:20,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 185 [2022-07-22 14:51:20,951 INFO L356 Elim1Store]: treesize reduction 415, result has 39.1 percent of original size [2022-07-22 14:51:20,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 55 case distinctions, treesize of input 200201 treesize of output 188248 [2022-07-22 14:51:23,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:23,290 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 626235 treesize of output 581539 [2022-07-22 14:52:09,004 WARN L233 SmtUtils]: Spent 45.71s on a formula simplification. DAG size of input: 1790 DAG size of output: 1767 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 14:52:59,380 WARN L233 SmtUtils]: Spent 13.06s on a formula simplification. DAG size of input: 494 DAG size of output: 485 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 14:53:13,960 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:53:14,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 6 treesize of output 4 [2022-07-22 14:53:14,203 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:53:14,203 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 13 treesize of output 9 [2022-07-22 14:53:14,285 INFO L356 Elim1Store]: treesize reduction 10, result has 88.8 percent of original size [2022-07-22 14:53:14,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 173 [2022-07-22 14:53:14,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:14,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 428 treesize of output 413 [2022-07-22 14:53:14,581 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:53:14,582 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 581 treesize of output 1 [2022-07-22 14:53:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-07-22 14:53:14,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617747948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:53:14,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:53:14,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2022-07-22 14:53:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380097040] [2022-07-22 14:53:14,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:53:14,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 14:53:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:53:14,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 14:53:14,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1163, Unknown=3, NotChecked=210, Total=1482 [2022-07-22 14:53:14,785 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 30 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-22 14:53:14,942 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_ArrVal_728 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_728))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse1 (select (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-22 14:53:15,716 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse1 (select (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-22 14:53:16,644 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 (select (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))))) is different from false [2022-07-22 14:53:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:16,735 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-22 14:53:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 14:53:16,736 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 30 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-07-22 14:53:16,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:16,738 INFO L225 Difference]: With dead ends: 46 [2022-07-22 14:53:16,738 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 14:53:16,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=135, Invalid=1365, Unknown=6, NotChecked=474, Total=1980 [2022-07-22 14:53:16,740 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:16,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 250 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2022-07-22 14:53:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 14:53:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-22 14:53:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:53:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-07-22 14:53:16,745 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 32 [2022-07-22 14:53:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:16,745 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-07-22 14:53:16,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5) internal successors, (57), 30 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-22 14:53:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-07-22 14:53:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:53:16,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:16,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:16,780 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:53:16,968 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,SelfDestructingSolverStorable5 [2022-07-22 14:53:16,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash -612599861, now seen corresponding path program 1 times [2022-07-22 14:53:16,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:53:16,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737891977] [2022-07-22 14:53:16,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:16,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:53:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:53:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:17,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:53:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:53:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:53:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737891977] [2022-07-22 14:53:17,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737891977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:53:17,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595696815] [2022-07-22 14:53:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:17,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:53:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:53:17,561 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:53:17,562 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:53:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:17,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-22 14:53:17,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:17,780 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:53:18,038 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:53:18,038 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 11 [2022-07-22 14:53:18,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:53:18,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:53:18,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:53:18,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:53:18,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:18,282 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-07-22 14:53:18,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 55 [2022-07-22 14:53:18,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:18,289 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 28 treesize of output 25 [2022-07-22 14:53:18,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:18,293 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 20 [2022-07-22 14:53:19,038 INFO L356 Elim1Store]: treesize reduction 647, result has 18.4 percent of original size [2022-07-22 14:53:19,040 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:53:19,056 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:53:19,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:53:19,241 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_58| input size 161 context size 161 output size 161 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java: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.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:53:19,244 INFO L158 Benchmark]: Toolchain (without parser) took 125150.56ms. Allocated memory was 98.6MB in the beginning and 612.4MB in the end (delta: 513.8MB). Free memory was 71.9MB in the beginning and 456.4MB in the end (delta: -384.5MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2022-07-22 14:53:19,245 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 55.9MB in the beginning and 55.9MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:53:19,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.03ms. Allocated memory is still 98.6MB. Free memory was 71.7MB in the beginning and 61.1MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 14:53:19,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.66ms. Allocated memory is still 98.6MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:53:19,246 INFO L158 Benchmark]: Boogie Preprocessor took 50.70ms. Allocated memory is still 98.6MB. Free memory was 59.0MB in the beginning and 57.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:53:19,246 INFO L158 Benchmark]: RCFGBuilder took 432.41ms. Allocated memory is still 98.6MB. Free memory was 57.3MB in the beginning and 71.5MB in the end (delta: -14.1MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-07-22 14:53:19,246 INFO L158 Benchmark]: TraceAbstraction took 124185.67ms. Allocated memory was 98.6MB in the beginning and 612.4MB in the end (delta: 513.8MB). Free memory was 70.8MB in the beginning and 456.4MB in the end (delta: -385.6MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2022-07-22 14:53:19,247 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.17ms. Allocated memory is still 81.8MB. Free memory was 55.9MB in the beginning and 55.9MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.03ms. Allocated memory is still 98.6MB. Free memory was 71.7MB in the beginning and 61.1MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.66ms. Allocated memory is still 98.6MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.70ms. Allocated memory is still 98.6MB. Free memory was 59.0MB in the beginning and 57.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.41ms. Allocated memory is still 98.6MB. Free memory was 57.3MB in the beginning and 71.5MB in the end (delta: -14.1MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 124185.67ms. Allocated memory was 98.6MB in the beginning and 612.4MB in the end (delta: 513.8MB). Free memory was 70.8MB in the beginning and 456.4MB in the end (delta: -385.6MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_58| input size 161 context size 161 output size 161 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_58| input size 161 context size 161 output size 161: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:53:19,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_remove_all.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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:53:21,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:53:21,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:53:21,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:53:21,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:53:21,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:53:21,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:53:21,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:53:21,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:53:21,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:53:21,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:53:21,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:53:21,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:53:21,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:53:21,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:53:21,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:53:21,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:53:21,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:53:21,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:53:21,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:53:21,244 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:53:21,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:53:21,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:53:21,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:53:21,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:53:21,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:53:21,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:53:21,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:53:21,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:53:21,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:53:21,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:53:21,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:53:21,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:53:21,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:53:21,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:53:21,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:53:21,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:53:21,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:53:21,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:53:21,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:53:21,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:53:21,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:53:21,271 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:53:21,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:53:21,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:53:21,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:53:21,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:53:21,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:53:21,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:53:21,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:53:21,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:53:21,308 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:53:21,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:53:21,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:53:21,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:53:21,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:53:21,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:53:21,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:53:21,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:53:21,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:53:21,310 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:53:21,310 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:53:21,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:53:21,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:53:21,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:53:21,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:53:21,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:53:21,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:53:21,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:53:21,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:53:21,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:53:21,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:53:21,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:53:21,313 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:53:21,313 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:53:21,313 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:53:21,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:53:21,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:53:21,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:53:21,314 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2022-07-22 14:53:21,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:53:21,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:53:21,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:53:21,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:53:21,677 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:53:21,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-07-22 14:53:21,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2cc501ab/22826427f79f4a9694ccec378a831ce9/FLAG6d5e00de0 [2022-07-22 14:53:22,229 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:53:22,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2022-07-22 14:53:22,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2cc501ab/22826427f79f4a9694ccec378a831ce9/FLAG6d5e00de0 [2022-07-22 14:53:22,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2cc501ab/22826427f79f4a9694ccec378a831ce9 [2022-07-22 14:53:22,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:53:22,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:53:22,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:53:22,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:53:22,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:53:22,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:53:22" (1/1) ... [2022-07-22 14:53:22,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79759ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:22, skipping insertion in model container [2022-07-22 14:53:22,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:53:22" (1/1) ... [2022-07-22 14:53:22,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:53:22,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:53:22,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-07-22 14:53:22,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:53:22,938 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:53:22,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2022-07-22 14:53:22,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:53:23,017 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:53:23,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23 WrapperNode [2022-07-22 14:53:23,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:53:23,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:53:23,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:53:23,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:53:23,025 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:53:23" (1/1) ... [2022-07-22 14:53:23,060 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:53:23" (1/1) ... [2022-07-22 14:53:23,088 INFO L137 Inliner]: procedures = 129, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2022-07-22 14:53:23,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:53:23,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:53:23,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:53:23,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:53:23,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:53:23,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:53:23,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:53:23,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:53:23,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (1/1) ... [2022-07-22 14:53:23,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:53:23,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:53:23,189 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:53:23,214 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:53:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-22 14:53:23,229 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-22 14:53:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:53:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 14:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:53:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:53:23,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:53:23,378 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:53:23,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:53:23,652 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:53:23,657 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:53:23,657 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:53:23,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:53:23 BoogieIcfgContainer [2022-07-22 14:53:23,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:53:23,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:53:23,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:53:23,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:53:23,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:53:22" (1/3) ... [2022-07-22 14:53:23,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b24309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:53:23, skipping insertion in model container [2022-07-22 14:53:23,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:53:23" (2/3) ... [2022-07-22 14:53:23,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b24309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:53:23, skipping insertion in model container [2022-07-22 14:53:23,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:53:23" (3/3) ... [2022-07-22 14:53:23,676 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2022-07-22 14:53:23,688 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:53:23,691 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:53:23,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:53:23,749 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@3a1523a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65a0db3a [2022-07-22 14:53:23,749 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:53:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:53:23,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:23,759 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:53:23,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1715695268, now seen corresponding path program 1 times [2022-07-22 14:53:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:23,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171739655] [2022-07-22 14:53:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:23,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:23,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:23,783 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:53:23,793 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:53:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:23,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:53:23,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:23,924 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:53:23,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:53:23,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:23,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171739655] [2022-07-22 14:53:23,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171739655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:53:23,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:53:23,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:53:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581992668] [2022-07-22 14:53:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:53:23,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:53:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:53:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:53:23,967 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:53:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:23,982 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-07-22 14:53:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:53:23,984 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:53:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:23,990 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:53:23,990 INFO L226 Difference]: Without dead ends: 23 [2022-07-22 14:53:23,992 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:53:23,995 INFO L413 NwaCegarLoop]: 32 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, 32 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:53:23,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:53:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-22 14:53:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-22 14:53:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 14:53:24,022 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-22 14:53:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:24,023 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 14:53:24,023 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:53:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 14:53:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:53:24,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:24,025 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:53:24,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:24,236 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:53:24,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1231917993, now seen corresponding path program 1 times [2022-07-22 14:53:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:24,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809202688] [2022-07-22 14:53:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:24,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:24,240 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:53:24,241 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:53:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:24,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:53:24,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:24,366 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:53:24,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:53:24,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:24,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809202688] [2022-07-22 14:53:24,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809202688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:53:24,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:53:24,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:53:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324769995] [2022-07-22 14:53:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:53:24,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:53:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:24,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:53:24,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:53:24,370 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:53:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:24,381 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-07-22 14:53:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:53:24,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:53:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:24,383 INFO L225 Difference]: With dead ends: 37 [2022-07-22 14:53:24,383 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 14:53:24,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:53:24,384 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:24,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:53:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 14:53:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-22 14:53:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 14:53:24,390 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-22 14:53:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:24,395 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 14:53:24,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:53:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 14:53:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:53:24,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:24,397 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:24,408 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:53:24,607 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:53:24,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash 899729579, now seen corresponding path program 1 times [2022-07-22 14:53:24,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:24,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275960281] [2022-07-22 14:53:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:24,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:53:24,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:53:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:24,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:53:24,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:53:24,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:53:24,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:24,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275960281] [2022-07-22 14:53:24,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275960281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:53:24,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:53:24,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:53:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414314660] [2022-07-22 14:53:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:53:24,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:53:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:53:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:53:24,813 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:53:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:24,841 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-22 14:53:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:53:24,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-22 14:53:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:24,843 INFO L225 Difference]: With dead ends: 31 [2022-07-22 14:53:24,843 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 14:53:24,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:53:24,845 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:24,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:53:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 14:53:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-22 14:53:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-22 14:53:24,855 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 26 [2022-07-22 14:53:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:24,856 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 14:53:24,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:53:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-22 14:53:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:53:24,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:24,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:24,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:25,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:53:25,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 491955104, now seen corresponding path program 1 times [2022-07-22 14:53:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:25,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797121289] [2022-07-22 14:53:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:25,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:25,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:25,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:53:25,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:53:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:25,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:53:25,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:53:25,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:53:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:53:25,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797121289] [2022-07-22 14:53:25,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797121289] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:53:25,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:53:25,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-22 14:53:25,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847285076] [2022-07-22 14:53:25,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:53:25,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:53:25,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:53:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:53:25,370 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:53:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:25,418 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-22 14:53:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:53:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-07-22 14:53:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:25,420 INFO L225 Difference]: With dead ends: 34 [2022-07-22 14:53:25,420 INFO L226 Difference]: Without dead ends: 30 [2022-07-22 14:53:25,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:53:25,421 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:25,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:53:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-22 14:53:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-22 14:53:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-22 14:53:25,427 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 29 [2022-07-22 14:53:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:25,427 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-22 14:53:25,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:53:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-22 14:53:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:53:25,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:25,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:25,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:25,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:53:25,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1349916533, now seen corresponding path program 2 times [2022-07-22 14:53:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:25,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845426788] [2022-07-22 14:53:25,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:53:25,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:25,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:25,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:53:25,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 14:53:25,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:53:25,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:53:25,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 14:53:25,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:25,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:53:25,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:53:25,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:53:25,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:53:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:53:25,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:53:25,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:53:25,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845426788] [2022-07-22 14:53:25,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845426788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:53:25,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:53:25,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:53:25,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970613209] [2022-07-22 14:53:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:53:25,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:53:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:53:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:53:25,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:53:25,944 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:53:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:53:26,331 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-07-22 14:53:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:53:26,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-07-22 14:53:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:53:26,333 INFO L225 Difference]: With dead ends: 37 [2022-07-22 14:53:26,333 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 14:53:26,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:53:26,334 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 14:53:26,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 14:53:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 14:53:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-22 14:53:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:53:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-22 14:53:26,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2022-07-22 14:53:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:53:26,339 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-22 14:53:26,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:53:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-22 14:53:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:53:26,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:53:26,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:53:26,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:53:26,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:53:26,552 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:53:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:53:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1292658231, now seen corresponding path program 1 times [2022-07-22 14:53:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:53:26,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36020809] [2022-07-22 14:53:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:53:26,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:53:26,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:53:26,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:53:26,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 14:53:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:53:26,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-22 14:53:26,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:53:26,832 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:53:26,941 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:53:26,942 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 12 treesize of output 12 [2022-07-22 14:53:26,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:53:27,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:53:27,117 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-22 14:53:27,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 29 [2022-07-22 14:53:27,247 INFO L356 Elim1Store]: treesize reduction 59, result has 18.1 percent of original size [2022-07-22 14:53:27,248 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 58 treesize of output 32 [2022-07-22 14:53:27,254 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:53:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:53:27,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:53:27,340 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 29 treesize of output 21 [2022-07-22 14:53:29,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_398))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse0)))))) is different from false [2022-07-22 14:53:31,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_398))))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-07-22 14:53:31,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_393))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_398))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-07-22 14:53:31,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:31,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 185 [2022-07-22 14:53:33,495 INFO L356 Elim1Store]: treesize reduction 425, result has 37.6 percent of original size [2022-07-22 14:53:33,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 55 case distinctions, treesize of input 369029 treesize of output 316984 [2022-07-22 14:53:35,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:53:35,502 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 451874 treesize of output 425232 [2022-07-22 14:53:47,001 WARN L233 SmtUtils]: Spent 11.50s on a formula simplification. DAG size of input: 1590 DAG size of output: 1586 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 14:54:14,244 WARN L233 SmtUtils]: Spent 13.24s on a formula simplification. DAG size of input: 1309 DAG size of output: 1237 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 14:54:25,416 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:54:25,442 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:54:25,456 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:54:25,469 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:54:25,479 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:54:25,485 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:54:25,697 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:54:25,706 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:54:25,719 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:54:25,725 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:54:25,732 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 22 treesize of output 18 [2022-07-22 14:54:25,742 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 31 treesize of output 27 [2022-07-22 14:54:25,748 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 23 [2022-07-22 14:54:25,763 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 20 treesize of output 16 [2022-07-22 14:54:25,770 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 15 treesize of output 13 [2022-07-22 14:54:25,777 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:54:25,782 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-22 14:54:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-07-22 14:54:26,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:54:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36020809] [2022-07-22 14:54:26,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36020809] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:54:26,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:54:26,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-07-22 14:54:26,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526106539] [2022-07-22 14:54:26,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:54:26,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 14:54:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:54:26,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 14:54:26,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=458, Unknown=3, NotChecked=132, Total=650 [2022-07-22 14:54:26,071 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:54:26,565 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_393))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_398))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) is different from false [2022-07-22 14:54:28,569 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_398))))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-22 14:54:30,574 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_398 (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_398))))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse0)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) is different from false [2022-07-22 14:54:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:54:31,450 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-07-22 14:54:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 14:54:31,451 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-07-22 14:54:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:54:31,453 INFO L225 Difference]: With dead ends: 51 [2022-07-22 14:54:31,453 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:54:31,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=82, Invalid=586, Unknown=6, NotChecked=318, Total=992 [2022-07-22 14:54:31,454 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:54:31,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 268 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 102 Unchecked, 1.3s Time] [2022-07-22 14:54:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:54:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-22 14:54:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:54:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-07-22 14:54:31,460 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 32 [2022-07-22 14:54:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:54:31,461 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-07-22 14:54:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:54:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-07-22 14:54:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:54:31,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:54:31,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:54:31,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:54:31,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:54:31,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:54:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:54:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash -612599861, now seen corresponding path program 1 times [2022-07-22 14:54:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:54:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920564850] [2022-07-22 14:54:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:54:31,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:54:31,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:54:31,679 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:54:31,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 14:54:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:54:32,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-22 14:54:32,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:54:32,041 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:54:32,112 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:54:32,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-22 14:54:32,266 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 14:54:32,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2022-07-22 14:54:32,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:54:32,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:54:32,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:54:32,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:54:32,555 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 14:54:32,555 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 50 [2022-07-22 14:54:32,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:54:32,563 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 26 treesize of output 23 [2022-07-22 14:54:32,567 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 14 treesize of output 18 [2022-07-22 14:54:32,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:54:33,329 INFO L356 Elim1Store]: treesize reduction 756, result has 6.1 percent of original size [2022-07-22 14:54:33,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 871 treesize of output 309 [2022-07-22 14:54:33,451 INFO L356 Elim1Store]: treesize reduction 342, result has 9.3 percent of original size [2022-07-22 14:54:33,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 11 new quantified variables, introduced 11 case distinctions, treesize of input 439 treesize of output 163 [2022-07-22 14:54:33,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:54:33,657 INFO L356 Elim1Store]: treesize reduction 106, result has 2.8 percent of original size [2022-07-22 14:54:33,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 148 treesize of output 79 [2022-07-22 14:54:33,679 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-22 14:54:33,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 31 [2022-07-22 14:54:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:54:33,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:54:55,358 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse8 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)))) (let ((.cse0 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (let ((.cse10 (select .cse8 .cse1))) (let ((.cse2 (select .cse10 .cse0))) (= .cse2 (let ((.cse6 (select .cse11 .cse1))) (let ((.cse9 (select .cse6 .cse0))) (select (select (let ((.cse3 (let ((.cse7 (bvadd .cse0 (_ bv4 32)))) (let ((.cse5 (select .cse10 .cse7))) (let ((.cse4 (store .cse8 .cse2 (store (select .cse8 .cse2) (bvadd (_ bv4 32) .cse9) .cse5)))) (store .cse4 .cse5 (store (select .cse4 .cse5) (select .cse6 .cse7) .cse2))))))) (store .cse3 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset| .cse2))) .cse2) .cse9))))))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse26 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse23 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)))) (let ((.cse14 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse15)) (let ((.cse25 (select .cse23 .cse15))) (let ((.cse16 (select .cse25 .cse14))) (= .cse16 (select (let ((.cse21 (select .cse26 .cse15))) (let ((.cse24 (select .cse21 .cse14))) (select (let ((.cse17 (let ((.cse22 (bvadd .cse14 (_ bv4 32)))) (let ((.cse20 (select .cse25 .cse22))) (let ((.cse18 (store .cse23 .cse24 (store (select .cse23 .cse24) (bvadd (_ bv4 32) .cse16) .cse20))) (.cse19 (select .cse21 .cse22))) (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 .cse16))))))) (store .cse17 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset| .cse16))) .cse24))) .cse16)))))))))) is different from false [2022-07-22 14:54:58,545 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse7 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (let ((.cse9 (select .cse7 .cse11))) (let ((.cse1 (select .cse9 .cse0))) (= .cse1 (let ((.cse5 (select .cse10 .cse11))) (let ((.cse8 (select .cse5 .cse0))) (select (select (let ((.cse2 (let ((.cse6 (bvadd .cse0 (_ bv4 32)))) (let ((.cse4 (select .cse9 .cse6))) (let ((.cse3 (store .cse7 .cse1 (store (select .cse7 .cse1) (bvadd (_ bv4 32) .cse8) .cse4)))) (store .cse3 .cse4 (store (select .cse3 .cse4) (select .cse5 .cse6) .cse1))))))) (store .cse2 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset| .cse1))) .cse1) .cse8)))))) (not (= .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse22 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)))) (let ((.cse14 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (let ((.cse24 (select .cse22 .cse26))) (let ((.cse16 (select .cse24 .cse14))) (= (select (let ((.cse20 (select .cse25 .cse26))) (let ((.cse23 (select .cse20 .cse14))) (select (let ((.cse15 (let ((.cse21 (bvadd .cse14 (_ bv4 32)))) (let ((.cse19 (select .cse24 .cse21))) (let ((.cse17 (store .cse22 .cse23 (store (select .cse22 .cse23) (bvadd (_ bv4 32) .cse16) .cse19))) (.cse18 (select .cse20 .cse21))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 .cse16))))))) (store .cse15 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset| .cse16))) .cse23))) .cse16) .cse16))) (not (= .cse26 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) is different from false [2022-07-22 14:55:01,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse7 (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_552))) (store (store .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)))) (.cse11 (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_551))) (store .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse9 (select .cse7 .cse12))) (let ((.cse1 (select .cse9 .cse10))) (= (select (let ((.cse5 (select .cse11 .cse12))) (let ((.cse8 (select .cse5 .cse10))) (select (let ((.cse0 (let ((.cse6 (bvadd (_ bv4 32) .cse10))) (let ((.cse4 (select .cse9 .cse6))) (let ((.cse2 (store .cse7 .cse8 (store (select .cse7 .cse8) (bvadd (_ bv4 32) .cse1) .cse4))) (.cse3 (select .cse5 .cse6))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 .cse1))))))) (store .cse0 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset| .cse1))) .cse8))) .cse1) .cse1))) (not (= .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse25 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_551))) (store .cse32 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (store .cse31 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse31 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse30 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse28 (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_552))) (store (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse30 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))))) (let ((.cse18 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse17 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= .cse18 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (let ((.cse27 (select .cse25 .cse17))) (let ((.cse20 (select .cse27 .cse18))) (= (let ((.cse23 (select .cse28 .cse17))) (let ((.cse26 (select .cse23 .cse18))) (select (select (let ((.cse19 (let ((.cse24 (bvadd (_ bv4 32) .cse18))) (let ((.cse22 (select .cse27 .cse24))) (let ((.cse21 (store .cse25 .cse20 (store (select .cse25 .cse20) (bvadd (_ bv4 32) .cse26) .cse22)))) (store .cse21 .cse22 (store (select .cse21 .cse22) (select .cse23 .cse24) .cse20))))))) (store .cse19 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset| .cse20))) .cse20) .cse26))) .cse20))))))))) is different from false [2022-07-22 14:55:02,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:55:02,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 5794 treesize of output 5226 [2022-07-22 14:55:02,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:55:11,526 WARN L233 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 14:55:11,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:55:11,527 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 1017412 treesize of output 1012858 [2022-07-22 14:55:14,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:55:14,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1009732 treesize of output 600108