./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_equal.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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:11:28,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:11:28,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:11:28,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:11:28,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:11:28,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:11:28,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:11:28,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:11:28,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:11:28,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:11:28,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:11:28,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:11:28,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:11:28,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:11:28,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:11:28,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:11:28,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:11:28,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:11:28,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:11:28,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:11:28,434 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:11:28,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:11:28,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:11:28,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:11:28,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:11:28,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:11:28,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:11:28,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:11:28,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:11:28,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:11:28,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:11:28,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:11:28,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:11:28,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:11:28,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:11:28,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:11:28,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:11:28,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:11:28,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:11:28,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:11:28,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:11:28,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:11:28,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:11:28,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:11:28,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:11:28,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:11:28,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:11:28,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:11:28,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:11:28,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:11:28,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:11:28,476 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:11:28,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:11:28,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:11:28,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:11:28,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:11:28,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:11:28,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:11:28,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:11:28,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:11:28,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:11:28,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:11:28,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:11:28,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:11:28,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:11:28,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:11:28,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:11:28,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:11:28,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:11:28,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:11:28,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:11:28,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:11:28,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:11:28,481 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:11:28,481 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:11:28,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:11:28,482 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-07-13 15:11:28,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:11:28,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:11:28,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:11:28,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:11:28,743 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:11:28,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-13 15:11:28,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db65d5ee/d748a63a28524a51bf98e0d1224da28e/FLAG19525d44c [2022-07-13 15:11:29,245 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:11:29,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-13 15:11:29,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db65d5ee/d748a63a28524a51bf98e0d1224da28e/FLAG19525d44c [2022-07-13 15:11:29,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db65d5ee/d748a63a28524a51bf98e0d1224da28e [2022-07-13 15:11:29,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:11:29,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:11:29,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:11:29,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:11:29,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:11:29,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6329c727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29, skipping insertion in model container [2022-07-13 15:11:29,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:11:29,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:11:29,571 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_insert_equal.i[24877,24890] [2022-07-13 15:11:29,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:11:29,581 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:11:29,613 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_insert_equal.i[24877,24890] [2022-07-13 15:11:29,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:11:29,630 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:11:29,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29 WrapperNode [2022-07-13 15:11:29,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:11:29,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:11:29,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:11:29,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:11:29,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,661 INFO L137 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 154 [2022-07-13 15:11:29,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:11:29,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:11:29,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:11:29,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:11:29,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:11:29,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:11:29,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:11:29,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:11:29,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (1/1) ... [2022-07-13 15:11:29,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:11:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:11:29,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:11:29,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:11:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:11:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:11:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:11:29,763 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:11:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:11:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:11:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:11:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:11:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:11:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:11:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:11:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:11:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:11:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:11:29,854 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:11:29,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:11:30,118 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:11:30,126 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:11:30,127 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 15:11:30,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:30 BoogieIcfgContainer [2022-07-13 15:11:30,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:11:30,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:11:30,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:11:30,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:11:30,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:11:29" (1/3) ... [2022-07-13 15:11:30,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40940072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:11:30, skipping insertion in model container [2022-07-13 15:11:30,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:29" (2/3) ... [2022-07-13 15:11:30,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40940072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:11:30, skipping insertion in model container [2022-07-13 15:11:30,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:30" (3/3) ... [2022-07-13 15:11:30,140 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-07-13 15:11:30,150 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:11:30,151 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:11:30,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:11:30,244 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@cb38f5e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2008aac0 [2022-07-13 15:11:30,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:11:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:11:30,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:30,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:30,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:30,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1237252285, now seen corresponding path program 1 times [2022-07-13 15:11:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:11:30,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857227225] [2022-07-13 15:11:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:11:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:11:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:11:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:11:30,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:11:30,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857227225] [2022-07-13 15:11:30,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857227225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:30,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:30,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:11:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838805929] [2022-07-13 15:11:30,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:30,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:11:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:11:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:11:30,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:11:30,537 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:11:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:30,619 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2022-07-13 15:11:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:11:30,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-13 15:11:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:30,626 INFO L225 Difference]: With dead ends: 67 [2022-07-13 15:11:30,626 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:11:30,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:11:30,630 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:30,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:11:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:11:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-13 15:11:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-13 15:11:30,653 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 25 [2022-07-13 15:11:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:30,654 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 15:11:30,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:11:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-13 15:11:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:11:30,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:30,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:30,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:11:30,656 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1104710801, now seen corresponding path program 1 times [2022-07-13 15:11:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:11:30,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181293696] [2022-07-13 15:11:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:11:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:11:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:11:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:11:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:11:30,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181293696] [2022-07-13 15:11:30,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181293696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:30,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:30,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:11:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409665222] [2022-07-13 15:11:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:30,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:11:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:11:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:11:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:30,762 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:11:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:30,817 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-07-13 15:11:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:11:30,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-13 15:11:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:30,819 INFO L225 Difference]: With dead ends: 56 [2022-07-13 15:11:30,819 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 15:11:30,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:30,820 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:30,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 82 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:11:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 15:11:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-13 15:11:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 15:11:30,825 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2022-07-13 15:11:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:30,826 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 15:11:30,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:11:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 15:11:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:11:30,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:30,827 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:30,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:11:30,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash -313226979, now seen corresponding path program 1 times [2022-07-13 15:11:30,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:11:30,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811764752] [2022-07-13 15:11:30,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:11:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:11:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:11:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:11:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 15:11:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:11:31,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811764752] [2022-07-13 15:11:31,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811764752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:31,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:31,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:11:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615360964] [2022-07-13 15:11:31,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:31,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:11:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:11:31,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:11:31,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:31,004 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:11:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:31,071 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-07-13 15:11:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:11:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-13 15:11:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:31,080 INFO L225 Difference]: With dead ends: 49 [2022-07-13 15:11:31,080 INFO L226 Difference]: Without dead ends: 41 [2022-07-13 15:11:31,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:31,082 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:31,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:11:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-13 15:11:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-07-13 15:11:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-07-13 15:11:31,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 35 [2022-07-13 15:11:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:31,089 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-07-13 15:11:31,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:11:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-07-13 15:11:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:11:31,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:31,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:31,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:11:31,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 415590512, now seen corresponding path program 1 times [2022-07-13 15:11:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:11:31,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544853722] [2022-07-13 15:11:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:11:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:11:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 15:11:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:11:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:11:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:11:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544853722] [2022-07-13 15:11:32,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544853722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:11:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205811020] [2022-07-13 15:11:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:32,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:11:32,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:11:32,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:11:32,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:11:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:32,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 203 conjunts are in the unsatisfiable core [2022-07-13 15:11:32,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:32,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:11:32,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:11:33,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:33,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:33,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:33,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-13 15:11:33,139 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:11:33,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 15:11:33,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:11:33,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:33,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:33,425 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 21 treesize of output 26 [2022-07-13 15:11:33,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:11:33,561 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:11:33,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 15:11:33,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:33,610 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:11:33,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-07-13 15:11:33,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-13 15:11:33,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:11:33,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-13 15:11:33,896 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:11:33,896 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 102 treesize of output 87 [2022-07-13 15:11:33,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 15:11:33,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-13 15:11:34,179 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:11:34,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 95 [2022-07-13 15:11:34,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,191 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-13 15:11:34,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2022-07-13 15:11:34,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-07-13 15:11:34,219 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-13 15:11:34,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2022-07-13 15:11:34,238 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-13 15:11:34,461 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:11:34,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 63 [2022-07-13 15:11:34,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-13 15:11:34,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-13 15:11:34,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:11:34,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,732 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:11:34,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 115 [2022-07-13 15:11:34,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 15:11:34,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2022-07-13 15:11:34,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:34,768 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:11:34,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-13 15:11:35,225 INFO L356 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2022-07-13 15:11:35,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 292 treesize of output 161 [2022-07-13 15:11:35,261 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-07-13 15:11:35,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 258 treesize of output 199 [2022-07-13 15:11:35,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:35,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:35,305 INFO L356 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2022-07-13 15:11:35,306 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:11:35,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:11:35,511 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-13 15:11:35,512 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$.offset_49| input size 87 context size 87 output size 87 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:11:35,516 INFO L158 Benchmark]: Toolchain (without parser) took 6241.32ms. Allocated memory was 94.4MB in the beginning and 207.6MB in the end (delta: 113.2MB). Free memory was 54.1MB in the beginning and 126.3MB in the end (delta: -72.3MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2022-07-13 15:11:35,516 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 94.4MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:11:35,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.01ms. Allocated memory was 94.4MB in the beginning and 140.5MB in the end (delta: 46.1MB). Free memory was 53.9MB in the beginning and 111.9MB in the end (delta: -58.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 15:11:35,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.12ms. Allocated memory is still 140.5MB. Free memory was 111.9MB in the beginning and 109.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:11:35,517 INFO L158 Benchmark]: Boogie Preprocessor took 26.98ms. Allocated memory is still 140.5MB. Free memory was 109.3MB in the beginning and 107.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:11:35,517 INFO L158 Benchmark]: RCFGBuilder took 440.21ms. Allocated memory is still 140.5MB. Free memory was 107.7MB in the beginning and 88.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 15:11:35,518 INFO L158 Benchmark]: TraceAbstraction took 5384.73ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 87.8MB in the beginning and 126.3MB in the end (delta: -38.6MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2022-07-13 15:11:35,519 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.09ms. Allocated memory is still 94.4MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.01ms. Allocated memory was 94.4MB in the beginning and 140.5MB in the end (delta: 46.1MB). Free memory was 53.9MB in the beginning and 111.9MB in the end (delta: -58.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.12ms. Allocated memory is still 140.5MB. Free memory was 111.9MB in the beginning and 109.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.98ms. Allocated memory is still 140.5MB. Free memory was 109.3MB in the beginning and 107.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.21ms. Allocated memory is still 140.5MB. Free memory was 107.7MB in the beginning and 88.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5384.73ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 87.8MB in the beginning and 126.3MB in the end (delta: -38.6MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.offset_49| input size 87 context size 87 output size 87 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.offset_49| input size 87 context size 87 output size 87: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:11:35,554 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_insert_equal.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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:11:37,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:11:37,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:11:37,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:11:37,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:11:37,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:11:37,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:11:37,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:11:37,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:11:37,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:11:37,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:11:37,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:11:37,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:11:37,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:11:37,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:11:37,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:11:37,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:11:37,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:11:37,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:11:37,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:11:37,264 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:11:37,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:11:37,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:11:37,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:11:37,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:11:37,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:11:37,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:11:37,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:11:37,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:11:37,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:11:37,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:11:37,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:11:37,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:11:37,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:11:37,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:11:37,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:11:37,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:11:37,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:11:37,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:11:37,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:11:37,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:11:37,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:11:37,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:11:37,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:11:37,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:11:37,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:11:37,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:11:37,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:11:37,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:11:37,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:11:37,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:11:37,312 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:11:37,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:11:37,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:11:37,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:11:37,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:11:37,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:11:37,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:11:37,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:11:37,314 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:11:37,314 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:11:37,315 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:11:37,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:11:37,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:11:37,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:11:37,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:11:37,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:11:37,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:11:37,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:11:37,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:11:37,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:11:37,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:11:37,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:11:37,317 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:11:37,317 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:11:37,317 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:11:37,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:11:37,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:11:37,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:11:37,318 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-07-13 15:11:37,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:11:37,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:11:37,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:11:37,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:11:37,635 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:11:37,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-13 15:11:37,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78d1f22/334a122e09c647ab88cd821181683aaf/FLAG3b5ffb35e [2022-07-13 15:11:38,090 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:11:38,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-07-13 15:11:38,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78d1f22/334a122e09c647ab88cd821181683aaf/FLAG3b5ffb35e [2022-07-13 15:11:38,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78d1f22/334a122e09c647ab88cd821181683aaf [2022-07-13 15:11:38,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:11:38,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:11:38,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:11:38,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:11:38,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:11:38,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3051ef9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38, skipping insertion in model container [2022-07-13 15:11:38,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:11:38,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:11:38,744 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_insert_equal.i[24877,24890] [2022-07-13 15:11:38,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:11:38,759 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:11:38,809 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_insert_equal.i[24877,24890] [2022-07-13 15:11:38,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:11:38,837 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:11:38,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38 WrapperNode [2022-07-13 15:11:38,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:11:38,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:11:38,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:11:38,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:11:38,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,898 INFO L137 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 155 [2022-07-13 15:11:38,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:11:38,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:11:38,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:11:38,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:11:38,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:11:38,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:11:38,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:11:38,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:11:38,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (1/1) ... [2022-07-13 15:11:38,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:11:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:11:38,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:11:38,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:11:38,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 15:11:38,995 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-13 15:11:38,995 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 15:11:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:11:38,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:11:38,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:11:38,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:11:39,071 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:11:39,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:11:39,469 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:11:39,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:11:39,474 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 15:11:39,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:39 BoogieIcfgContainer [2022-07-13 15:11:39,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:11:39,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:11:39,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:11:39,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:11:39,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:11:38" (1/3) ... [2022-07-13 15:11:39,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7313717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:11:39, skipping insertion in model container [2022-07-13 15:11:39,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:38" (2/3) ... [2022-07-13 15:11:39,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7313717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:11:39, skipping insertion in model container [2022-07-13 15:11:39,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:39" (3/3) ... [2022-07-13 15:11:39,486 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-07-13 15:11:39,498 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:11:39,498 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:11:39,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:11:39,550 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@5f79dabb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47106187 [2022-07-13 15:11:39,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:11:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:11:39,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:39,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:39,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1237252285, now seen corresponding path program 1 times [2022-07-13 15:11:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:39,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311106624] [2022-07-13 15:11:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:39,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:39,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:39,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:11:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:39,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:11:39,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 15:11:39,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:39,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:39,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311106624] [2022-07-13 15:11:39,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311106624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:39,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:39,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:11:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886131090] [2022-07-13 15:11:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:39,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:11:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:39,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:11:39,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:11:39,839 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:11:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:39,856 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2022-07-13 15:11:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:11:39,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-13 15:11:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:39,863 INFO L225 Difference]: With dead ends: 67 [2022-07-13 15:11:39,863 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:11:39,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:11:39,871 INFO L413 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:39,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:11:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:11:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-13 15:11:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-13 15:11:39,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 25 [2022-07-13 15:11:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:39,902 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 15:11:39,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:11:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-13 15:11:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:11:39,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:39,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:39,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 15:11:40,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:40,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1104710801, now seen corresponding path program 1 times [2022-07-13 15:11:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:40,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467977268] [2022-07-13 15:11:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:40,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:40,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:40,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:40,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:11:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:40,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:11:40,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:11:40,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:40,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:40,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467977268] [2022-07-13 15:11:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467977268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:40,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:40,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:11:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351284547] [2022-07-13 15:11:40,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:40,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:11:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:11:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:11:40,310 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:11:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:40,321 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-07-13 15:11:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:11:40,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-13 15:11:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:40,322 INFO L225 Difference]: With dead ends: 56 [2022-07-13 15:11:40,323 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 15:11:40,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:11:40,324 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:40,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:11:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 15:11:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-13 15:11:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 15:11:40,329 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2022-07-13 15:11:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:40,329 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 15:11:40,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 15:11:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 15:11:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:11:40,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:40,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:40,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:11:40,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:11:40,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash -313226979, now seen corresponding path program 1 times [2022-07-13 15:11:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:40,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081997598] [2022-07-13 15:11:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:40,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:11:40,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:11:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:40,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:11:40,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 15:11:40,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:11:40,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:40,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081997598] [2022-07-13 15:11:40,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081997598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:11:40,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:11:40,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:11:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591926543] [2022-07-13 15:11:40,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:11:40,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:11:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:11:40,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:11:40,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:11:40,742 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:11:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:11:40,773 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-07-13 15:11:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:11:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-13 15:11:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:11:40,775 INFO L225 Difference]: With dead ends: 43 [2022-07-13 15:11:40,775 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 15:11:40,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:11:40,776 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:11:40,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:11:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 15:11:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-13 15:11:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:11:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-07-13 15:11:40,780 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 35 [2022-07-13 15:11:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:11:40,780 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-13 15:11:40,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:11:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-07-13 15:11:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:11:40,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:11:40,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:11:40,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 15:11:40,991 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-13 15:11:40,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:11:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:11:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash 415590512, now seen corresponding path program 1 times [2022-07-13 15:11:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:11:40,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75169712] [2022-07-13 15:11:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:40,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:11:40,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:11:40,993 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-13 15:11:40,994 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-13 15:11:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:41,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-13 15:11:41,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:41,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:11:41,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:11:41,525 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:11:41,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 15:11:41,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:11:41,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:11:41,832 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 15:11:41,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-07-13 15:11:41,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:11:41,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:11:42,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 15:11:42,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 15:11:42,329 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-13 15:11:42,329 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 2 case distinctions, treesize of input 109 treesize of output 66 [2022-07-13 15:11:42,340 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 13 treesize of output 15 [2022-07-13 15:11:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:42,352 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-13 15:11:42,360 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-13 15:11:42,595 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-13 15:11:42,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 44 [2022-07-13 15:11:42,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-13 15:11:42,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:11:42,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:11:42,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:42,978 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-13 15:11:42,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 80 [2022-07-13 15:11:42,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:42,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 15:11:43,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:43,029 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-13 15:11:43,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-07-13 15:11:43,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 15:11:43,909 INFO L356 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2022-07-13 15:11:43,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 236 treesize of output 145 [2022-07-13 15:11:44,041 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-07-13 15:11:44,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 254 treesize of output 197 [2022-07-13 15:11:44,071 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 0 case distinctions, treesize of input 53 treesize of output 51 [2022-07-13 15:11:44,151 INFO L356 Elim1Store]: treesize reduction 213, result has 11.6 percent of original size [2022-07-13 15:11:44,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, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 133 [2022-07-13 15:11:44,181 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-13 15:11:44,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 141 [2022-07-13 15:11:44,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-07-13 15:11:44,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 15:11:44,360 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:11:44,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2022-07-13 15:11:44,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:11:44,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 18 [2022-07-13 15:11:44,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:11:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:11:44,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:11:44,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_448) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:11:44,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (_ BitVec 32))) (= (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_465) .cse0 v_ArrVal_448) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_453) .cse0 v_ArrVal_464) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7|))) .cse0 v_ArrVal_467) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:11:45,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (_ BitVec 32))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse3 .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_447)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_465) .cse2 v_ArrVal_448) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse3 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_453) .cse2 v_ArrVal_464) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse1) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7|))) .cse2 v_ArrVal_467) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-13 15:11:46,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:11:46,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75169712] [2022-07-13 15:11:46,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75169712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:11:46,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2039415940] [2022-07-13 15:11:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:11:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:11:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:11:46,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:11:46,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-07-13 15:11:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:11:47,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-13 15:11:47,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:11:47,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:11:48,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:11:48,227 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:11:48,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-07-13 15:11:48,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:11:48,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:11:48,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:11:48,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 15:11:48,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 15:11:48,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 15:11:49,147 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-07-13 15:11:49,150 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:11:49,161 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-13 15:11:49,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-07-13 15:11:49,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-13 15:11:49,557 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_57| input size 69 context size 69 output size 69 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:11:49,560 INFO L158 Benchmark]: Toolchain (without parser) took 11118.95ms. Allocated memory was 67.1MB in the beginning and 111.1MB in the end (delta: 44.0MB). Free memory was 47.5MB in the beginning and 73.1MB in the end (delta: -25.6MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2022-07-13 15:11:49,560 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:11:49,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.17ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 41.1MB in the end (delta: 6.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-07-13 15:11:49,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.26ms. Allocated memory is still 67.1MB. Free memory was 41.1MB in the beginning and 38.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:11:49,561 INFO L158 Benchmark]: Boogie Preprocessor took 40.51ms. Allocated memory is still 67.1MB. Free memory was 38.6MB in the beginning and 36.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:11:49,561 INFO L158 Benchmark]: RCFGBuilder took 534.66ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 36.4MB in the beginning and 61.9MB in the end (delta: -25.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-13 15:11:49,561 INFO L158 Benchmark]: TraceAbstraction took 10083.17ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 73.1MB in the end (delta: -11.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-07-13 15:11:49,562 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.16ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.17ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 41.1MB in the end (delta: 6.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.26ms. Allocated memory is still 67.1MB. Free memory was 41.1MB in the beginning and 38.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.51ms. Allocated memory is still 67.1MB. Free memory was 38.6MB in the beginning and 36.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 534.66ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 36.4MB in the beginning and 61.9MB in the end (delta: -25.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10083.17ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 73.1MB in the end (delta: -11.6MB). Peak memory consumption was 54.5MB. 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_57| input size 69 context size 69 output size 69 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_57| input size 69 context size 69 output size 69: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:11:49,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_57| input size 69 context size 69 output size 69