./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/sll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:44:26,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:44:26,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:44:26,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:44:26,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:44:26,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:44:26,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:44:26,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:44:26,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:44:26,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:44:26,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:44:26,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:44:26,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:44:26,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:44:26,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:44:26,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:44:26,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:44:26,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:44:26,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:44:26,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:44:26,562 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:44:26,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:44:26,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:44:26,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:44:26,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:44:26,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:44:26,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:44:26,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:44:26,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:44:26,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:44:26,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:44:26,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:44:26,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:44:26,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:44:26,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:44:26,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:44:26,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:44:26,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:44:26,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:44:26,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:44:26,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:44:26,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:44:26,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:44:26,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:44:26,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:44:26,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:44:26,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:44:26,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:44:26,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:44:26,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:44:26,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:44:26,599 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:44:26,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:44:26,600 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:44:26,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:44:26,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:44:26,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:44:26,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:44:26,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:44:26,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:44:26,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:44:26,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:44:26,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:44:26,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:44:26,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:44:26,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:44:26,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:44:26,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:26,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:44:26,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:44:26,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:44:26,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:44:26,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:44:26,603 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:44:26,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:44:26,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:44:26,604 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-07-19 14:44:26,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:44:26,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:44:26,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:44:26,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:44:26,802 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:44:26,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-19 14:44:26,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e25484b/59ec1aaa739e4b8b8b29b1b743c2908d/FLAG3b4083f10 [2022-07-19 14:44:27,249 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:44:27,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-19 14:44:27,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e25484b/59ec1aaa739e4b8b8b29b1b743c2908d/FLAG3b4083f10 [2022-07-19 14:44:27,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e25484b/59ec1aaa739e4b8b8b29b1b743c2908d [2022-07-19 14:44:27,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:44:27,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:44:27,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:27,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:44:27,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:44:27,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ded4595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27, skipping insertion in model container [2022-07-19 14:44:27,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:44:27,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:44:27,588 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/sll2n_insert_unequal.i[24620,24633] [2022-07-19 14:44:27,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:27,594 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:44:27,649 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/sll2n_insert_unequal.i[24620,24633] [2022-07-19 14:44:27,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:27,665 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:44:27,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27 WrapperNode [2022-07-19 14:44:27,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:27,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:27,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:44:27,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:44:27,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,695 INFO L137 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2022-07-19 14:44:27,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:27,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:44:27,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:44:27,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:44:27,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:44:27,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:44:27,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:44:27,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:44:27,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (1/1) ... [2022-07-19 14:44:27,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:27,757 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-19 14:44:27,791 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-19 14:44:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:44:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:44:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:44:27,808 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:44:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:44:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:44:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:44:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:44:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:44:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:44:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:44:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:44:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:44:27,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:44:27,908 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:44:27,909 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:44:28,080 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:44:28,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:44:28,085 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 14:44:28,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:28 BoogieIcfgContainer [2022-07-19 14:44:28,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:44:28,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:44:28,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:44:28,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:44:28,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:44:27" (1/3) ... [2022-07-19 14:44:28,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c79516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:28, skipping insertion in model container [2022-07-19 14:44:28,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:27" (2/3) ... [2022-07-19 14:44:28,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c79516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:28, skipping insertion in model container [2022-07-19 14:44:28,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:28" (3/3) ... [2022-07-19 14:44:28,101 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-07-19 14:44:28,110 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:44:28,110 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:44:28,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:44:28,141 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@6c2c2f59, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@45c6f295 [2022-07-19 14:44:28,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:44:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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-19 14:44:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:28,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:28,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:28,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash -246443823, now seen corresponding path program 1 times [2022-07-19 14:44:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:28,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762605276] [2022-07-19 14:44:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 14:44:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:28,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762605276] [2022-07-19 14:44:28,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762605276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:28,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:28,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:44:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157281439] [2022-07-19 14:44:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:28,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:44:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:44:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:44:28,381 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:28,435 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2022-07-19 14:44:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:44:28,437 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-19 14:44:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:28,441 INFO L225 Difference]: With dead ends: 62 [2022-07-19 14:44:28,442 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:44:28,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:44:28,447 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:28,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:44:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:44:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-19 14:44:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-07-19 14:44:28,472 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2022-07-19 14:44:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:28,472 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-19 14:44:28,472 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-07-19 14:44:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:28,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:28,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:28,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:44:28,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1738034235, now seen corresponding path program 1 times [2022-07-19 14:44:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:28,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747880262] [2022-07-19 14:44:28,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 14:44:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:28,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747880262] [2022-07-19 14:44:28,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747880262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:28,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:28,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:44:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958388404] [2022-07-19 14:44:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:28,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:44:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:28,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:44:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:28,599 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:28,647 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-07-19 14:44:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:28,648 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-19 14:44:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:28,649 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:44:28,649 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 14:44:28,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:28,650 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:28,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 14:44:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-19 14:44:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-19 14:44:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:44:28,657 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2022-07-19 14:44:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:28,657 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:44:28,657 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:44:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:44:28,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:28,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:28,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:44:28,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:28,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1368908325, now seen corresponding path program 1 times [2022-07-19 14:44:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:28,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289045387] [2022-07-19 14:44:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 14:44:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:28,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289045387] [2022-07-19 14:44:28,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289045387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:28,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124552934] [2022-07-19 14:44:28,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:28,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:28,756 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-19 14:44:28,757 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-19 14:44:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:28,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:44:28,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:28,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:28,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124552934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:44:28,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:44:28,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-19 14:44:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705142836] [2022-07-19 14:44:28,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:28,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:44:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:44:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:28,987 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:29,034 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-07-19 14:44:29,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:44:29,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-19 14:44:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:29,035 INFO L225 Difference]: With dead ends: 55 [2022-07-19 14:44:29,035 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 14:44:29,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:29,036 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:29,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 14:44:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-19 14:44:29,040 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-19 14:44:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-07-19 14:44:29,041 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 28 [2022-07-19 14:44:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:29,041 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-07-19 14:44:29,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-07-19 14:44:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:44:29,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:29,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:29,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:29,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:29,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1136271419, now seen corresponding path program 2 times [2022-07-19 14:44:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:29,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037990259] [2022-07-19 14:44:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:44:29,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:29,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037990259] [2022-07-19 14:44:29,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037990259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:29,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:29,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:44:29,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786425587] [2022-07-19 14:44:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:29,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:44:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:29,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:44:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:29,402 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-19 14:44:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:29,428 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-07-19 14:44:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:29,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 37 [2022-07-19 14:44:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:29,430 INFO L225 Difference]: With dead ends: 57 [2022-07-19 14:44:29,430 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 14:44:29,430 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-19 14:44:29,431 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:29,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 14:44:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-07-19 14:44:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-07-19 14:44:29,436 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 37 [2022-07-19 14:44:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:29,436 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-19 14:44:29,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-19 14:44:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-07-19 14:44:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:44:29,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:29,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:29,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:44:29,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1079013117, now seen corresponding path program 1 times [2022-07-19 14:44:29,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:29,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882945977] [2022-07-19 14:44:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:29,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:44:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:29,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882945977] [2022-07-19 14:44:29,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882945977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:29,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238899883] [2022-07-19 14:44:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:29,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:29,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:29,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:44:29,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:44:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:44:29,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:44:29,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:44:29,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238899883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:29,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:44:29,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 14:44:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512578817] [2022-07-19 14:44:29,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:29,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:44:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:29,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:44:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:29,788 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:29,817 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-07-19 14:44:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 37 [2022-07-19 14:44:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:29,820 INFO L225 Difference]: With dead ends: 46 [2022-07-19 14:44:29,820 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 14:44:29,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:44:29,821 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 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-19 14:44:29,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 14:44:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-19 14:44:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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-19 14:44:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-19 14:44:29,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 37 [2022-07-19 14:44:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:29,837 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-19 14:44:29,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-07-19 14:44:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:44:29,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:29,840 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:29,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:30,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:30,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash -300753136, now seen corresponding path program 1 times [2022-07-19 14:44:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:30,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140432688] [2022-07-19 14:44:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:30,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140432688] [2022-07-19 14:44:30,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140432688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:30,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431359230] [2022-07-19 14:44:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:30,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:30,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:30,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:44:30,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:44:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:30,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-19 14:44:30,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:31,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-19 14:44:31,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-19 14:44:31,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-19 14:44:31,415 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 34 treesize of output 22 [2022-07-19 14:44:31,420 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 11 treesize of output 3 [2022-07-19 14:44:31,429 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-19 14:44:31,434 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-19 14:44:31,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:31,667 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 40 treesize of output 38 [2022-07-19 14:44:31,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:31,676 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 22 treesize of output 24 [2022-07-19 14:44:31,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:31,683 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 36 treesize of output 34 [2022-07-19 14:44:31,696 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:44:31,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:44:31,942 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:31,943 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 93 treesize of output 84 [2022-07-19 14:44:31,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:31,951 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 41 treesize of output 36 [2022-07-19 14:44:31,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:31,955 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 55 treesize of output 41 [2022-07-19 14:44:32,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:32,029 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 56 treesize of output 52 [2022-07-19 14:44:32,040 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 22 treesize of output 24 [2022-07-19 14:44:32,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:32,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:32,049 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 53 treesize of output 52 [2022-07-19 14:44:32,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2022-07-19 14:44:32,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:32,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2022-07-19 14:44:32,152 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-19 14:44:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:44:32,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:32,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_623) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-19 14:44:32,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_616)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_623) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:44:32,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_616)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_623) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:44:32,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_616)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_623) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:44:32,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| Int) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_633)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_631))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_632))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_616))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_623) (select (select (store (store .cse3 .cse1 v_ArrVal_620) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11|) 0)))) is different from false [2022-07-19 14:44:32,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431359230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:32,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:32,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2022-07-19 14:44:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545475912] [2022-07-19 14:44:32,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:32,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 14:44:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 14:44:32,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1032, Unknown=5, NotChecked=340, Total=1482 [2022-07-19 14:44:32,335 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:33,019 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-07-19 14:44:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 14:44:33,019 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-07-19 14:44:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:33,020 INFO L225 Difference]: With dead ends: 55 [2022-07-19 14:44:33,020 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 14:44:33,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=1638, Unknown=5, NotChecked=430, Total=2256 [2022-07-19 14:44:33,022 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:33,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 232 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 543 Invalid, 0 Unknown, 3 Unchecked, 0.4s Time] [2022-07-19 14:44:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 14:44:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-07-19 14:44:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-19 14:44:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-07-19 14:44:33,042 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 38 [2022-07-19 14:44:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:33,042 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-19 14:44:33,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-07-19 14:44:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:44:33,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:33,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:33,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:33,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:33,252 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash -243494834, now seen corresponding path program 1 times [2022-07-19 14:44:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:33,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944285893] [2022-07-19 14:44:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:33,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:33,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944285893] [2022-07-19 14:44:33,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944285893] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:33,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850634037] [2022-07-19 14:44:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:33,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:33,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:33,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:44:33,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:44:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:33,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-19 14:44:33,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:33,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-19 14:44:33,752 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:44:33,782 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_794 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_794))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-07-19 14:44:33,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:33,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-19 14:44:33,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 14:44:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-07-19 14:44:33,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:33,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_16| Int) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_16| v_ArrVal_797) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (< |v_node_create_~temp~0#1.base_16| |c_#StackHeapBarrier|)) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2022-07-19 14:44:33,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850634037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:33,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:33,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-19 14:44:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803827244] [2022-07-19 14:44:33,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:33,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 14:44:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:44:33,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 14:44:33,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=528, Unknown=2, NotChecked=94, Total=702 [2022-07-19 14:44:33,931 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:34,163 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2022-07-19 14:44:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:44:34,167 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-07-19 14:44:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:34,167 INFO L225 Difference]: With dead ends: 60 [2022-07-19 14:44:34,167 INFO L226 Difference]: Without dead ends: 49 [2022-07-19 14:44:34,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=865, Unknown=2, NotChecked=122, Total=1122 [2022-07-19 14:44:34,168 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:34,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 280 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-07-19 14:44:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-19 14:44:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-07-19 14:44:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 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-19 14:44:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-19 14:44:34,177 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 38 [2022-07-19 14:44:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:34,177 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-19 14:44:34,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-07-19 14:44:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:44:34,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:34,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:34,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:34,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:34,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash -733467546, now seen corresponding path program 1 times [2022-07-19 14:44:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:44:34,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543205330] [2022-07-19 14:44:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:44:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:44:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:44:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:44:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:44:34,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543205330] [2022-07-19 14:44:34,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543205330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:34,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430030916] [2022-07-19 14:44:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:34,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:34,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:34,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:44:34,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 14:44:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:34,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-19 14:44:34,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:34,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-19 14:44:35,025 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_958 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_958) |c_#memory_$Pointer$.base|)) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_#res#1.base| 0))) is different from true [2022-07-19 14:44:35,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:35,036 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 15 treesize of output 17 [2022-07-19 14:44:35,178 INFO L356 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2022-07-19 14:44:35,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2022-07-19 14:44:35,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:35,496 INFO L356 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2022-07-19 14:44:35,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 107 [2022-07-19 14:44:35,502 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:44:35,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:35,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:44:35,702 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-19 14:44:35,708 INFO L158 Benchmark]: Toolchain (without parser) took 8431.15ms. Allocated memory was 88.1MB in the beginning and 142.6MB in the end (delta: 54.5MB). Free memory was 56.6MB in the beginning and 112.2MB in the end (delta: -55.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2022-07-19 14:44:35,709 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:44:35,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.96ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 57.3MB in the end (delta: -922.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:44:35,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.77ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:35,709 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 53.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:35,709 INFO L158 Benchmark]: RCFGBuilder took 361.63ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 38.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:44:35,710 INFO L158 Benchmark]: TraceAbstraction took 7620.80ms. Allocated memory was 88.1MB in the beginning and 142.6MB in the end (delta: 54.5MB). Free memory was 38.0MB in the beginning and 112.2MB in the end (delta: -74.2MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-07-19 14:44:35,711 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 88.1MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.96ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 57.3MB in the end (delta: -922.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.77ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 53.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.63ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 38.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7620.80ms. Allocated memory was 88.1MB in the beginning and 142.6MB in the end (delta: 54.5MB). Free memory was 38.0MB in the beginning and 112.2MB in the end (delta: -74.2MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:44:35,732 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 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/sll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:44:37,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:44:37,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:44:37,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:44:37,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:44:37,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:44:37,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:44:37,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:44:37,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:44:37,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:44:37,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:44:37,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:44:37,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:44:37,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:44:37,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:44:37,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:44:37,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:44:37,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:44:37,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:44:37,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:44:37,479 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:44:37,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:44:37,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:44:37,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:44:37,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:44:37,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:44:37,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:44:37,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:44:37,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:44:37,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:44:37,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:44:37,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:44:37,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:44:37,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:44:37,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:44:37,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:44:37,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:44:37,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:44:37,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:44:37,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:44:37,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:44:37,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:44:37,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:44:37,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:44:37,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:44:37,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:44:37,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:44:37,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:44:37,526 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:44:37,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:44:37,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:44:37,527 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:44:37,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:44:37,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:44:37,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:44:37,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:44:37,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:44:37,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:44:37,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:44:37,529 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:44:37,529 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:44:37,529 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:44:37,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:44:37,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:44:37,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:44:37,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:44:37,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:44:37,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:44:37,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:44:37,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:37,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:44:37,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:44:37,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:44:37,531 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:44:37,531 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:37,531 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:44:37,531 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:44:37,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:44:37,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:44:37,532 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-07-19 14:44:37,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:44:37,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:44:37,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:44:37,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:44:37,813 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:44:37,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-19 14:44:37,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61364e88e/17deaab03fce48f7b6a1dc2629c0089a/FLAGa23916635 [2022-07-19 14:44:38,265 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:44:38,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-07-19 14:44:38,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61364e88e/17deaab03fce48f7b6a1dc2629c0089a/FLAGa23916635 [2022-07-19 14:44:38,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61364e88e/17deaab03fce48f7b6a1dc2629c0089a [2022-07-19 14:44:38,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:44:38,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:44:38,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:38,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:44:38,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:44:38,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:38,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585b4fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38, skipping insertion in model container [2022-07-19 14:44:38,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:38,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:44:38,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:44:38,872 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/sll2n_insert_unequal.i[24620,24633] [2022-07-19 14:44:38,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:38,890 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:44:38,934 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/sll2n_insert_unequal.i[24620,24633] [2022-07-19 14:44:38,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:44:38,964 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:44:38,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38 WrapperNode [2022-07-19 14:44:38,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:44:38,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:38,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:44:38,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:44:38,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:38,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,000 INFO L137 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2022-07-19 14:44:39,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:44:39,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:44:39,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:44:39,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:44:39,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:44:39,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:44:39,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:44:39,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:44:39,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (1/1) ... [2022-07-19 14:44:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:44:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:44:39,058 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-19 14:44:39,059 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-19 14:44:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:44:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:44:39,079 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:44:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:44:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:44:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:44:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:44:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:44:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:44:39,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:44:39,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:44:39,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:44:39,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:44:39,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:44:39,189 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:44:39,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:44:39,423 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:44:39,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:44:39,428 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 14:44:39,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:39 BoogieIcfgContainer [2022-07-19 14:44:39,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:44:39,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:44:39,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:44:39,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:44:39,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:44:38" (1/3) ... [2022-07-19 14:44:39,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69414a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:39, skipping insertion in model container [2022-07-19 14:44:39,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:44:38" (2/3) ... [2022-07-19 14:44:39,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69414a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:44:39, skipping insertion in model container [2022-07-19 14:44:39,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:44:39" (3/3) ... [2022-07-19 14:44:39,434 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-07-19 14:44:39,445 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:44:39,446 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:44:39,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:44:39,500 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@3b953418, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c77e10e [2022-07-19 14:44:39,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:44:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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-19 14:44:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:39,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:39,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:39,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -246443823, now seen corresponding path program 1 times [2022-07-19 14:44:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:39,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342246823] [2022-07-19 14:44:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:39,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:39,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:39,528 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-19 14:44:39,529 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-19 14:44:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:39,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:44:39,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:39,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:44:39,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342246823] [2022-07-19 14:44:39,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342246823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:39,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:39,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:44:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138025173] [2022-07-19 14:44:39,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:39,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:44:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:44:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:44:39,704 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:39,719 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2022-07-19 14:44:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:44:39,720 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-19 14:44:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:39,724 INFO L225 Difference]: With dead ends: 62 [2022-07-19 14:44:39,725 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:44:39,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-19 14:44:39,729 INFO L413 NwaCegarLoop]: 44 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, 44 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-19 14:44:39,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:44:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:44:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-19 14:44:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-07-19 14:44:39,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2022-07-19 14:44:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:39,754 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-19 14:44:39,754 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-07-19 14:44:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:44:39,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:39,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:39,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:39,960 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-19 14:44:39,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1738034235, now seen corresponding path program 1 times [2022-07-19 14:44:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:39,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581080124] [2022-07-19 14:44:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:39,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:39,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:39,964 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-19 14:44:39,975 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-19 14:44:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:40,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:44:40,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:40,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:44:40,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581080124] [2022-07-19 14:44:40,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581080124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:40,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:40,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:44:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13928352] [2022-07-19 14:44:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:40,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:44:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:44:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:44:40,093 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:40,104 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-07-19 14:44:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:44:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-19 14:44:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:40,106 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:44:40,106 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 14:44:40,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-19 14:44:40,107 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 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-19 14:44:40,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 14:44:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-19 14:44:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-19 14:44:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:44:40,112 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2022-07-19 14:44:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:40,112 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:44:40,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:44:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:44:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:44:40,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:40,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:40,128 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-19 14:44:40,323 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-19 14:44:40,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1368908325, now seen corresponding path program 1 times [2022-07-19 14:44:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:40,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449831624] [2022-07-19 14:44:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:40,326 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-19 14:44:40,327 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-19 14:44:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:40,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:44:40,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:40,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:40,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:40,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449831624] [2022-07-19 14:44:40,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449831624] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:44:40,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:40,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 14:44:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756145584] [2022-07-19 14:44:40,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:40,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:44:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:44:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:40,520 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:40,548 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-07-19 14:44:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:44:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-19 14:44:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:40,550 INFO L225 Difference]: With dead ends: 58 [2022-07-19 14:44:40,550 INFO L226 Difference]: Without dead ends: 36 [2022-07-19 14:44:40,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:40,551 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:40,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-19 14:44:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-07-19 14:44:40,554 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-19 14:44:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-07-19 14:44:40,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 28 [2022-07-19 14:44:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:40,558 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-07-19 14:44:40,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:44:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-07-19 14:44:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:44:40,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:40,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:40,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:40,764 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-19 14:44:40,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1136271419, now seen corresponding path program 2 times [2022-07-19 14:44:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:40,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499185607] [2022-07-19 14:44:40,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:44:40,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:40,770 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-19 14:44:40,772 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-19 14:44:40,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 14:44:40,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:44:40,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:44:40,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:44:40,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:44:40,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:40,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499185607] [2022-07-19 14:44:40,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499185607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:44:40,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:44:40,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:44:40,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743908178] [2022-07-19 14:44:40,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:44:40,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:44:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:40,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:44:40,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:44:40,908 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:40,951 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-07-19 14:44:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:40,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 37 [2022-07-19 14:44:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:40,953 INFO L225 Difference]: With dead ends: 46 [2022-07-19 14:44:40,953 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 14:44:40,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-19 14:44:40,955 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 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-19 14:44:40,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 14:44:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-19 14:44:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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-19 14:44:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-19 14:44:40,960 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 37 [2022-07-19 14:44:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:40,961 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-19 14:44:40,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 14:44:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-07-19 14:44:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:44:40,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:40,962 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:40,977 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-19 14:44:41,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:41,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash -300753136, now seen corresponding path program 1 times [2022-07-19 14:44:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:41,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719587857] [2022-07-19 14:44:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:41,173 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:41,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:44:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:41,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-19 14:44:41,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:41,551 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-19 14:44:41,599 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-19 14:44:41,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:41,741 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 21 treesize of output 20 [2022-07-19 14:44:41,752 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 6 treesize of output 5 [2022-07-19 14:44:41,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-19 14:44:41,948 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-19 14:44:41,956 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-19 14:44:41,963 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-19 14:44:42,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:42,277 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 38 treesize of output 36 [2022-07-19 14:44:42,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:42,286 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-19 14:44:42,305 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:44:42,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-19 14:44:42,348 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:44:42,348 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:44:42,360 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-19 14:44:42,662 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:42,662 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 72 treesize of output 65 [2022-07-19 14:44:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:42,671 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 37 treesize of output 32 [2022-07-19 14:44:42,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:42,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 14:44:42,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-19 14:44:42,765 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-19 14:44:42,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:42,775 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 14 treesize of output 16 [2022-07-19 14:44:42,908 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 34 treesize of output 18 [2022-07-19 14:44:42,913 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-19 14:44:42,989 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 15 treesize of output 7 [2022-07-19 14:44:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:44:43,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:43,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_236) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-19 14:44:43,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (_ BitVec 32)) (v_ArrVal_237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) v_ArrVal_234)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_236) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-19 14:44:43,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (_ BitVec 32)) (v_ArrVal_237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)) v_ArrVal_234)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_236) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_235) |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-19 14:44:43,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_234 (_ BitVec 32)) (v_ArrVal_237 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)) v_ArrVal_234)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_236) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_233) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_232) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:44:43,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:43,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719587857] [2022-07-19 14:44:43,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719587857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:43,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1457393673] [2022-07-19 14:44:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:43,568 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:44:43,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:44:43,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-19 14:44:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:43,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 14:44:43,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:44,000 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-19 14:44:44,020 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-19 14:44:44,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:44,160 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 21 treesize of output 20 [2022-07-19 14:44:44,479 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 31 treesize of output 19 [2022-07-19 14:44:44,484 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-19 14:44:44,489 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-19 14:44:44,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-19 14:44:44,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:44,616 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 37 treesize of output 35 [2022-07-19 14:44:44,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:44,625 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-19 14:44:44,639 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:44:44,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-19 14:44:44,673 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:44:44,673 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:44:44,681 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-19 14:44:45,101 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:45,101 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 72 treesize of output 65 [2022-07-19 14:44:45,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:45,112 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 37 treesize of output 32 [2022-07-19 14:44:45,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:45,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 14:44:45,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:45,245 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 33 treesize of output 31 [2022-07-19 14:44:45,254 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-19 14:44:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:45,264 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 14 treesize of output 16 [2022-07-19 14:44:45,461 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 34 treesize of output 18 [2022-07-19 14:44:45,472 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-19 14:44:45,491 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 15 treesize of output 7 [2022-07-19 14:44:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:44:45,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:45,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_325) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_324) |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-19 14:44:45,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_321 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) v_ArrVal_321)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_325) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-19 14:44:45,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_321 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)) v_ArrVal_321)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_325) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-19 14:44:45,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_321 (_ BitVec 32)) (v_ArrVal_325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)) v_ArrVal_321)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_325) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_319) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_322) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:44:46,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1457393673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:46,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:46,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2022-07-19 14:44:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626550438] [2022-07-19 14:44:46,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:46,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 14:44:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 14:44:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1058, Unknown=20, NotChecked=584, Total=1806 [2022-07-19 14:44:46,183 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 25 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:47,202 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-07-19 14:44:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 14:44:47,203 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 25 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-07-19 14:44:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:47,204 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:44:47,204 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 14:44:47,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=201, Invalid=1533, Unknown=20, NotChecked=696, Total=2450 [2022-07-19 14:44:47,205 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:47,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 189 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 95 Unchecked, 0.4s Time] [2022-07-19 14:44:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 14:44:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-19 14:44:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-07-19 14:44:47,210 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 38 [2022-07-19 14:44:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:47,210 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-07-19 14:44:47,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 25 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-07-19 14:44:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:44:47,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:47,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:47,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-07-19 14:44:47,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:47,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:47,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -243494834, now seen corresponding path program 1 times [2022-07-19 14:44:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996621190] [2022-07-19 14:44:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:47,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:47,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:47,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:44:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:47,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 14:44:47,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:47,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 14:44:47,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-19 14:44:47,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:47,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-19 14:44:48,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-19 14:44:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:44:48,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:48,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:48,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996621190] [2022-07-19 14:44:48,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996621190] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:48,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [556372204] [2022-07-19 14:44:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:48,126 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:48,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:44:48,127 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:44:48,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-19 14:44:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:48,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 14:44:48,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:48,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-19 14:44:48,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:48,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-19 14:44:48,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-19 14:44:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:44:48,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:48,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [556372204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:48,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:48,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2022-07-19 14:44:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80368255] [2022-07-19 14:44:48,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 14:44:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 14:44:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=463, Unknown=7, NotChecked=0, Total=552 [2022-07-19 14:44:48,786 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:49,170 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-07-19 14:44:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:44:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-07-19 14:44:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:49,172 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:44:49,172 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 14:44:49,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=630, Unknown=9, NotChecked=0, Total=756 [2022-07-19 14:44:49,174 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:49,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 326 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 55 Unchecked, 0.3s Time] [2022-07-19 14:44:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 14:44:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-07-19 14:44:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-07-19 14:44:49,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 38 [2022-07-19 14:44:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:49,179 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-07-19 14:44:49,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:44:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-07-19 14:44:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:44:49,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:49,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:49,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:49,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:49,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:49,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash -733467546, now seen corresponding path program 1 times [2022-07-19 14:44:49,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:49,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972561949] [2022-07-19 14:44:49,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:49,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:49,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:49,587 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:49,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:44:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:49,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 14:44:49,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:49,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-19 14:44:50,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:50,153 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 22 treesize of output 22 [2022-07-19 14:44:50,396 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:50,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-19 14:44:50,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:50,467 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 22 treesize of output 22 [2022-07-19 14:44:50,608 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 23 treesize of output 11 [2022-07-19 14:44:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:44:50,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:50,727 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-07-19 14:44:50,747 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-07-19 14:44:50,779 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-07-19 14:44:50,787 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|)) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_532) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))) is different from false [2022-07-19 14:44:50,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972561949] [2022-07-19 14:44:50,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972561949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1524193562] [2022-07-19 14:44:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:44:50,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:44:50,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-19 14:44:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:51,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 14:44:51,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:51,697 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-19 14:44:51,697 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 53 treesize of output 57 [2022-07-19 14:44:51,719 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:44:51,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2022-07-19 14:44:51,741 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 38 treesize of output 32 [2022-07-19 14:44:51,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:51,984 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 14:44:51,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 80 [2022-07-19 14:44:51,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:51,994 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 86 treesize of output 86 [2022-07-19 14:44:52,000 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:44:52,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:52,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:52,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:52,404 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-19 14:44:52,406 INFO L158 Benchmark]: Toolchain (without parser) took 13779.20ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 53.0MB in the beginning and 96.9MB in the end (delta: -43.9MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2022-07-19 14:44:52,407 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 71.3MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:44:52,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.54ms. Allocated memory is still 71.3MB. Free memory was 52.8MB in the beginning and 47.0MB in the end (delta: 5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 14:44:52,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.40ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 44.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:52,407 INFO L158 Benchmark]: Boogie Preprocessor took 29.03ms. Allocated memory is still 71.3MB. Free memory was 44.6MB in the beginning and 42.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:52,407 INFO L158 Benchmark]: RCFGBuilder took 398.94ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 42.6MB in the beginning and 68.5MB in the end (delta: -25.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:52,408 INFO L158 Benchmark]: TraceAbstraction took 12975.91ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 68.1MB in the beginning and 96.9MB in the end (delta: -28.8MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2022-07-19 14:44:52,409 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.10ms. Allocated memory is still 71.3MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.54ms. Allocated memory is still 71.3MB. Free memory was 52.8MB in the beginning and 47.0MB in the end (delta: 5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.40ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 44.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.03ms. Allocated memory is still 71.3MB. Free memory was 44.6MB in the beginning and 42.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.94ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 42.6MB in the beginning and 68.5MB in the end (delta: -25.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12975.91ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 68.1MB in the beginning and 96.9MB in the end (delta: -28.8MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:44:52,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER