./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:51:16,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:51:16,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:51:16,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:51:16,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:51:16,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:51:16,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:51:16,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:51:16,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:51:16,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:51:16,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:51:16,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:51:16,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:51:16,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:51:16,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:51:16,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:51:16,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:51:16,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:51:16,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:51:16,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:51:16,479 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:51:16,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:51:16,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:51:16,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:51:16,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:51:16,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:51:16,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:51:16,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:51:16,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:51:16,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:51:16,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:51:16,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:51:16,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:51:16,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:51:16,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:51:16,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:51:16,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:51:16,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:51:16,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:51:16,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:51:16,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:51:16,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:51:16,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:51:16,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:51:16,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:51:16,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:51:16,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:51:16,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:51:16,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:51:16,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:51:16,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:51:16,538 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:51:16,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:51:16,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:51:16,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:51:16,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:51:16,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:51:16,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:51:16,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:51:16,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:51:16,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:51:16,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:51:16,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:51:16,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:51:16,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:51:16,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:51:16,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:51:16,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:16,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:51:16,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:51:16,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:51:16,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:51:16,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:51:16,543 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:51:16,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:51:16,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:51:16,543 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2022-07-22 14:51:16,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:51:16,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:51:16,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:51:16,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:51:16,791 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:51:16,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2022-07-22 14:51:16,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4036d9acd/fc663b857cb14cc3bd94db36ce5a2390/FLAGb76b01ad7 [2022-07-22 14:51:17,266 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:51:17,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2022-07-22 14:51:17,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4036d9acd/fc663b857cb14cc3bd94db36ce5a2390/FLAGb76b01ad7 [2022-07-22 14:51:17,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4036d9acd/fc663b857cb14cc3bd94db36ce5a2390 [2022-07-22 14:51:17,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:51:17,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:51:17,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:17,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:51:17,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:51:17,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf5fb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17, skipping insertion in model container [2022-07-22 14:51:17,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:51:17,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:51:17,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2022-07-22 14:51:17,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:17,638 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:51:17,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2022-07-22 14:51:17,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:17,701 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:51:17,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17 WrapperNode [2022-07-22 14:51:17,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:17,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:17,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:51:17,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:51:17,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,736 INFO L137 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2022-07-22 14:51:17,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:17,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:51:17,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:51:17,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:51:17,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:51:17,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:51:17,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:51:17,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:51:17,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (1/1) ... [2022-07-22 14:51:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:17,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:51:17,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:51:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:51:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-22 14:51:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-22 14:51:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:51:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:51:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:51:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:51:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:51:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:51:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:51:17,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:51:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:51:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:51:17,921 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:51:17,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:51:18,109 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:51:18,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:51:18,115 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:51:18,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:18 BoogieIcfgContainer [2022-07-22 14:51:18,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:51:18,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:51:18,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:51:18,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:51:18,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:51:17" (1/3) ... [2022-07-22 14:51:18,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18aeba2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:18, skipping insertion in model container [2022-07-22 14:51:18,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:17" (2/3) ... [2022-07-22 14:51:18,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18aeba2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:18, skipping insertion in model container [2022-07-22 14:51:18,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:18" (3/3) ... [2022-07-22 14:51:18,124 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2022-07-22 14:51:18,135 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:51:18,136 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:51:18,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:51:18,176 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@40fa18f2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e5248c4 [2022-07-22 14:51:18,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:51:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.391304347826087) 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-22 14:51:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:51:18,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:18,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:18,192 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1539835526, now seen corresponding path program 1 times [2022-07-22 14:51:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:18,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922343279] [2022-07-22 14:51:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:18,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:18,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922343279] [2022-07-22 14:51:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922343279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:18,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:51:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502451432] [2022-07-22 14:51:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:18,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:51:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:18,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:51:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:18,496 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.391304347826087) 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:18,549 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-07-22 14:51:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:51:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:51:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:18,556 INFO L225 Difference]: With dead ends: 41 [2022-07-22 14:51:18,556 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 14:51:18,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:18,570 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:18,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 14:51:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-22 14:51:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 14:51:18,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-22 14:51:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:18,598 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 14:51:18,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 14:51:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:51:18,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:18,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:18,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:51:18,600 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1407777735, now seen corresponding path program 1 times [2022-07-22 14:51:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:18,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332961718] [2022-07-22 14:51:18,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:18,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332961718] [2022-07-22 14:51:18,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332961718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:18,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:18,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:51:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879492922] [2022-07-22 14:51:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:18,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:51:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:18,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:51:18,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:18,701 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:18,738 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-22 14:51:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:51:18,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:51:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:18,740 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:51:18,741 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 14:51:18,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:18,748 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:18,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 14:51:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-22 14:51:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-22 14:51:18,762 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2022-07-22 14:51:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:18,763 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 14:51:18,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-22 14:51:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:51:18,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:18,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:18,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:51:18,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1822611693, now seen corresponding path program 1 times [2022-07-22 14:51:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:18,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028139658] [2022-07-22 14:51:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:18,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028139658] [2022-07-22 14:51:18,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028139658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:18,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:18,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:51:18,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750282125] [2022-07-22 14:51:18,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:18,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:51:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:51:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:51:18,969 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:19,023 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-22 14:51:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:51:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-22 14:51:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:19,025 INFO L225 Difference]: With dead ends: 33 [2022-07-22 14:51:19,026 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 14:51:19,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:51:19,029 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:19,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 14:51:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-22 14:51:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-22 14:51:19,039 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 26 [2022-07-22 14:51:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:19,040 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-22 14:51:19,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-22 14:51:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 14:51:19,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:19,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:19,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:51:19,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash -346016110, now seen corresponding path program 1 times [2022-07-22 14:51:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:19,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807164947] [2022-07-22 14:51:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:19,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:19,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807164947] [2022-07-22 14:51:19,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807164947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829866562] [2022-07-22 14:51:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:19,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:19,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:19,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:19,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:51:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:19,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:51:19,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:19,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:19,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829866562] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:51:19,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:51:19,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-22 14:51:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550660753] [2022-07-22 14:51:19,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:19,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 14:51:19,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 14:51:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:51:19,447 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:51:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:19,491 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-22 14:51:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:51:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-22 14:51:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:19,493 INFO L225 Difference]: With dead ends: 34 [2022-07-22 14:51:19,493 INFO L226 Difference]: Without dead ends: 30 [2022-07-22 14:51:19,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:51:19,494 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:19,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 82 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-22 14:51:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 14:51:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-22 14:51:19,500 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 30 [2022-07-22 14:51:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:19,500 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-22 14:51:19,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:51:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-22 14:51:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:51:19,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:19,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:19,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:19,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:19,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash -348374601, now seen corresponding path program 2 times [2022-07-22 14:51:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:19,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362833280] [2022-07-22 14:51:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:51:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:19,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362833280] [2022-07-22 14:51:19,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362833280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:19,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:19,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:51:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798281349] [2022-07-22 14:51:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:19,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:51:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:51:19,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:51:19,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:51:19,839 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:19,919 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-22 14:51:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:51:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 34 [2022-07-22 14:51:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:19,921 INFO L225 Difference]: With dead ends: 41 [2022-07-22 14:51:19,921 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 14:51:19,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:51:19,922 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:19,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:51:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 14:51:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-07-22 14:51:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-22 14:51:19,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2022-07-22 14:51:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:19,927 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-22 14:51:19,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-22 14:51:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:51:19,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:19,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:19,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 14:51:19,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1426632761, now seen corresponding path program 1 times [2022-07-22 14:51:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:51:19,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78548180] [2022-07-22 14:51:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:51:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:51:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:51:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:51:20,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78548180] [2022-07-22 14:51:20,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78548180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:51:20,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678027604] [2022-07-22 14:51:20,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:20,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:51:20,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:20,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:51:20,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:51:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:20,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-22 14:51:20,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:20,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:20,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:20,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:20,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:20,567 INFO L356 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2022-07-22 14:51:20,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 91 [2022-07-22 14:51:20,650 INFO L356 Elim1Store]: treesize reduction 148, result has 20.0 percent of original size [2022-07-22 14:51:20,651 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:51:20,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:20,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 14:51:20,852 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.offset_37| input size 75 context size 75 output size 75 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:51:20,856 INFO L158 Benchmark]: Toolchain (without parser) took 3561.35ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 93.6MB in the beginning and 88.2MB in the end (delta: 5.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-22 14:51:20,856 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 119.5MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:51:20,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.10ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 86.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:51:20,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.86ms. Allocated memory is still 119.5MB. Free memory was 86.4MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:51:20,857 INFO L158 Benchmark]: Boogie Preprocessor took 22.80ms. Allocated memory is still 119.5MB. Free memory was 84.3MB in the beginning and 82.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:51:20,857 INFO L158 Benchmark]: RCFGBuilder took 355.69ms. Allocated memory is still 119.5MB. Free memory was 82.8MB in the beginning and 68.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 14:51:20,858 INFO L158 Benchmark]: TraceAbstraction took 2737.40ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 68.1MB in the beginning and 88.2MB in the end (delta: -20.1MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-07-22 14:51:20,861 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.19ms. Allocated memory is still 119.5MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.10ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 86.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.86ms. Allocated memory is still 119.5MB. Free memory was 86.4MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.80ms. Allocated memory is still 119.5MB. Free memory was 84.3MB in the beginning and 82.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.69ms. Allocated memory is still 119.5MB. Free memory was 82.8MB in the beginning and 68.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2737.40ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 68.1MB in the beginning and 88.2MB in the end (delta: -20.1MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.offset_37| input size 75 context size 75 output size 75 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.offset_37| input size 75 context size 75 output size 75: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:51:20,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:51:22,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:51:22,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:51:22,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:51:22,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:51:22,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:51:22,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:51:22,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:51:22,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:51:22,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:51:22,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:51:22,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:51:22,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:51:22,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:51:22,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:51:22,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:51:22,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:51:22,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:51:22,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:51:22,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:51:22,899 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:51:22,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:51:22,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:51:22,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:51:22,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:51:22,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:51:22,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:51:22,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:51:22,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:51:22,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:51:22,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:51:22,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:51:22,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:51:22,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:51:22,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:51:22,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:51:22,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:51:22,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:51:22,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:51:22,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:51:22,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:51:22,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:51:22,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:51:22,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:51:22,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:51:22,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:51:22,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:51:22,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:51:22,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:51:22,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:51:22,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:51:22,965 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:51:22,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:51:22,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:51:22,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:51:22,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:51:22,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:51:22,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:51:22,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:51:22,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:51:22,967 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:51:22,968 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:51:22,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:51:22,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:51:22,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:51:22,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:51:22,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:51:22,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:51:22,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:51:22,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:22,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:51:22,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:51:22,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:51:22,970 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:51:22,970 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:51:22,970 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:51:22,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:51:22,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:51:22,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:51:22,971 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2022-07-22 14:51:23,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:51:23,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:51:23,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:51:23,323 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:51:23,324 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:51:23,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2022-07-22 14:51:23,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e4c1bac/f792afe50806438d8031035e8f233bf1/FLAGae7e9d7a5 [2022-07-22 14:51:23,893 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:51:23,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2022-07-22 14:51:23,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e4c1bac/f792afe50806438d8031035e8f233bf1/FLAGae7e9d7a5 [2022-07-22 14:51:24,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e4c1bac/f792afe50806438d8031035e8f233bf1 [2022-07-22 14:51:24,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:51:24,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:51:24,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:24,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:51:24,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:51:24,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a579aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24, skipping insertion in model container [2022-07-22 14:51:24,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:51:24,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:51:24,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2022-07-22 14:51:24,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:24,748 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:51:24,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2022-07-22 14:51:24,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:51:24,842 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:51:24,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24 WrapperNode [2022-07-22 14:51:24,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:51:24,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:24,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:51:24,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:51:24,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,914 INFO L137 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2022-07-22 14:51:24,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:51:24,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:51:24,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:51:24,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:51:24,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:51:24,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:51:24,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:51:24,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:51:24,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (1/1) ... [2022-07-22 14:51:24,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:51:24,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:51:25,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:51:25,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:51:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-22 14:51:25,065 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-22 14:51:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:51:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:51:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:51:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:51:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:51:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:51:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 14:51:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:51:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:51:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:51:25,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:51:25,215 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:51:25,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:51:25,483 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:51:25,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:51:25,489 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:51:25,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:25 BoogieIcfgContainer [2022-07-22 14:51:25,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:51:25,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:51:25,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:51:25,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:51:25,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:51:24" (1/3) ... [2022-07-22 14:51:25,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287d328d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:25, skipping insertion in model container [2022-07-22 14:51:25,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:51:24" (2/3) ... [2022-07-22 14:51:25,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287d328d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:51:25, skipping insertion in model container [2022-07-22 14:51:25,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:51:25" (3/3) ... [2022-07-22 14:51:25,498 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2022-07-22 14:51:25,510 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:51:25,511 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:51:25,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:51:25,555 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@22560ec8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b1dc889 [2022-07-22 14:51:25,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:51:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.391304347826087) 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-22 14:51:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:51:25,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:25,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:25,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:25,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1539835526, now seen corresponding path program 1 times [2022-07-22 14:51:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:51:25,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077517244] [2022-07-22 14:51:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:25,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:51:25,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:51:25,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:51:25,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:51:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:25,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:51:25,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:25,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:51:25,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:51:25,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077517244] [2022-07-22 14:51:25,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077517244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:25,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:25,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:51:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454332875] [2022-07-22 14:51:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:25,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:51:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:51:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:51:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:51:25,826 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.391304347826087) 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:25,845 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-07-22 14:51:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:51:25,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:51:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:25,855 INFO L225 Difference]: With dead ends: 41 [2022-07-22 14:51:25,855 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 14:51:25,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:51:25,868 INFO L413 NwaCegarLoop]: 33 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, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:25,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 14:51:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-22 14:51:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 14:51:25,901 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-22 14:51:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:25,904 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 14:51:25,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 14:51:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:51:25,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:25,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:25,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 14:51:26,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:51:26,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1407777735, now seen corresponding path program 1 times [2022-07-22 14:51:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:51:26,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086353277] [2022-07-22 14:51:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:26,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:51:26,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:51:26,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:51:26,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:51:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:26,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:51:26,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:26,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:51:26,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:51:26,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086353277] [2022-07-22 14:51:26,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086353277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:26,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:26,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:51:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636889375] [2022-07-22 14:51:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:26,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:51:26,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:51:26,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:51:26,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:26,266 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:26,286 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-22 14:51:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:51:26,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-22 14:51:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:26,291 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:51:26,291 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 14:51:26,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:51:26,293 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:26,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 14:51:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-22 14:51:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-22 14:51:26,301 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2022-07-22 14:51:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:26,302 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 14:51:26,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 14:51:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-22 14:51:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:51:26,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:26,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:26,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:26,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:51:26,515 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1822611693, now seen corresponding path program 1 times [2022-07-22 14:51:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:51:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745349189] [2022-07-22 14:51:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:26,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:51:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:51:26,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:51:26,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:51:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:26,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:51:26,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:26,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:51:26,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:51:26,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745349189] [2022-07-22 14:51:26,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745349189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:26,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:26,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:51:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885425531] [2022-07-22 14:51:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:26,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:51:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:51:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:51:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:26,706 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:26,729 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-22 14:51:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:51:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-22 14:51:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:26,731 INFO L225 Difference]: With dead ends: 33 [2022-07-22 14:51:26,731 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 14:51:26,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:51:26,732 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:26,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 14:51:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-22 14:51:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:51:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-22 14:51:26,738 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 26 [2022-07-22 14:51:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:26,738 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-22 14:51:26,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-22 14:51:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 14:51:26,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:26,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:26,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:26,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:51:26,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash -346016110, now seen corresponding path program 1 times [2022-07-22 14:51:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:51:26,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49069617] [2022-07-22 14:51:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:26,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:51:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:51:26,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:51:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:51:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:27,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-22 14:51:27,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:27,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:51:27,306 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:51:27,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-22 14:51:27,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:27,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 14:51:27,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:51:27,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:27,515 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-22 14:51:27,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 26 [2022-07-22 14:51:27,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:51:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:27,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:27,615 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 23 [2022-07-22 14:51:28,065 INFO L356 Elim1Store]: treesize reduction 49, result has 70.5 percent of original size [2022-07-22 14:51:28,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 1352 treesize of output 1303 [2022-07-22 14:51:28,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:51:28,190 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 1198 treesize of output 1114 [2022-07-22 14:51:28,225 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 1542 treesize of output 1470 [2022-07-22 14:51:29,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:29,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:29,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:29,930 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 47 treesize of output 43 [2022-07-22 14:51:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:51:30,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:51:30,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49069617] [2022-07-22 14:51:30,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49069617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:51:30,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:30,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-07-22 14:51:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552122565] [2022-07-22 14:51:30,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:30,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 14:51:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:51:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 14:51:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2022-07-22 14:51:30,214 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 14:51:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:31,417 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-07-22 14:51:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 14:51:31,420 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-07-22 14:51:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:31,421 INFO L225 Difference]: With dead ends: 55 [2022-07-22 14:51:31,421 INFO L226 Difference]: Without dead ends: 47 [2022-07-22 14:51:31,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-07-22 14:51:31,422 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:31,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 275 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 259 Invalid, 0 Unknown, 42 Unchecked, 0.9s Time] [2022-07-22 14:51:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-22 14:51:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-07-22 14:51:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 30 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-22 14:51:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-22 14:51:31,428 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 30 [2022-07-22 14:51:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:31,428 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-22 14:51:31,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 14:51:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-22 14:51:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 14:51:31,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:31,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:31,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:31,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:51:31,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1428991252, now seen corresponding path program 1 times [2022-07-22 14:51:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:51:31,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471264306] [2022-07-22 14:51:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:31,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:51:31,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:51:31,646 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:51:31,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 14:51:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:31,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:51:31,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:31,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:51:31,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:51:31,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471264306] [2022-07-22 14:51:31,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471264306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:51:31,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:51:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-22 14:51:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074842610] [2022-07-22 14:51:31,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:51:31,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:51:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:51:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:51:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:51:31,922 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:51:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:31,986 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-07-22 14:51:31,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:51:31,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-22 14:51:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:31,989 INFO L225 Difference]: With dead ends: 46 [2022-07-22 14:51:31,989 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:51:31,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:51:31,990 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:31,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 110 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:51:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:51:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-07-22 14:51:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-22 14:51:31,995 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 30 [2022-07-22 14:51:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:31,997 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-22 14:51:31,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 14:51:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-22 14:51:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:51:31,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:31,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:32,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:32,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:51:32,212 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash 352689977, now seen corresponding path program 1 times [2022-07-22 14:51:32,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:51:32,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541641535] [2022-07-22 14:51:32,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:51:32,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:51:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:51:32,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:51:32,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 14:51:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:51:32,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 14:51:32,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:32,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:32,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:32,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:32,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:51:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:51:32,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:51:32,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:51:32,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541641535] [2022-07-22 14:51:32,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541641535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:51:32,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:51:32,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:51:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803851418] [2022-07-22 14:51:32,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:51:32,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:51:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:51:32,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:51:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:51:32,420 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:51:32,693 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-07-22 14:51:32,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:51:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 34 [2022-07-22 14:51:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:51:32,695 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:51:32,695 INFO L226 Difference]: Without dead ends: 46 [2022-07-22 14:51:32,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:51:32,696 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:51:32,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 87 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:51:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-22 14:51:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-07-22 14:51:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:51:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-22 14:51:32,702 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 34 [2022-07-22 14:51:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:51:32,703 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-22 14:51:32,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 14:51:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-22 14:51:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:51:32,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:51:32,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:51:32,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:51:32,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:51:32,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:51:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:51:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2127697339, now seen corresponding path program 2 times [2022-07-22 14:51:32,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:51:32,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588292584] [2022-07-22 14:51:32,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:51:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:51:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:51:32,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:51:32,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 14:51:33,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:51:33,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:51:33,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-22 14:51:33,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:51:33,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:33,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:51:33,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:33,750 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 14:51:33,750 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 48 treesize of output 34 [2022-07-22 14:51:33,778 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-22 14:51:33,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 42 [2022-07-22 14:51:34,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:34,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:34,417 INFO L356 Elim1Store]: treesize reduction 417, result has 8.6 percent of original size [2022-07-22 14:51:34,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 582 treesize of output 232 [2022-07-22 14:51:34,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:34,594 INFO L356 Elim1Store]: treesize reduction 588, result has 6.2 percent of original size [2022-07-22 14:51:34,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 109 [2022-07-22 14:51:34,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:51:34,816 INFO L356 Elim1Store]: treesize reduction 76, result has 3.8 percent of original size [2022-07-22 14:51:34,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 62 [2022-07-22 14:51:34,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:51:34,838 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 14:51:34,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 24 [2022-07-22 14:51:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:51:34,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:51:47,074 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:52:20,625 WARN L233 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:52:23,512 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_506 (_ BitVec 32)) (v_ArrVal_504 (_ BitVec 32))) (let ((.cse16 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse11 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse7 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (store .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))))) (let ((.cse14 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (select .cse11 .cse0)) (.cse9 (bvadd (_ bv4 32) .cse14))) (let ((.cse1 (select .cse12 .cse9))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (= .cse0 .cse1) (let ((.cse8 (select .cse7 .cse0))) (let ((.cse13 (bvadd (_ bv4 32) (select .cse8 .cse9)))) (let ((.cse6 (select (select .cse7 .cse1) .cse13)) (.cse5 (select (select .cse11 .cse1) .cse13))) (let ((.cse3 (let ((.cse10 (store .cse11 .cse0 (store .cse12 .cse9 .cse5)))) (store .cse10 .cse5 (store (select .cse10 .cse5) .cse6 v_ArrVal_506))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store .cse7 .cse0 (store .cse8 .cse9 .cse6)))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_504))) |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse14))))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_506 (_ BitVec 32)) (v_ArrVal_504 (_ BitVec 32))) (let ((.cse35 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse28 (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse24 (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (store .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))))) (let ((.cse33 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse25 (select .cse24 .cse18)) (.cse26 (bvadd (_ bv4 32) .cse33))) (let ((.cse32 (select .cse25 .cse26))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse18)) (let ((.cse29 (select .cse28 .cse18))) (let ((.cse30 (select .cse29 .cse26)) (.cse31 (bvadd (_ bv4 32) .cse32))) (let ((.cse23 (select (select .cse24 .cse30) .cse31)) (.cse22 (select (select .cse28 .cse30) .cse31))) (let ((.cse20 (let ((.cse27 (store .cse28 .cse18 (store .cse29 .cse26 .cse22)))) (store .cse27 .cse22 (store (select .cse27 .cse22) .cse23 v_ArrVal_506))))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse19 (select (select .cse20 .cse19) (bvadd (_ bv4 32) (select (select (let ((.cse21 (store .cse24 .cse18 (store .cse25 .cse26 .cse23)))) (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 v_ArrVal_504))) |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse33)) (= .cse33 .cse32)))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_506 (_ BitVec 32)) (v_ArrVal_504 (_ BitVec 32))) (let ((.cse54 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse42 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse54 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse47 (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (store .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse54 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))))) (let ((.cse52 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (select (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select .cse47 .cse37)) (.cse44 (bvadd (_ bv4 32) .cse52))) (let ((.cse51 (select .cse48 .cse44))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse37)) (let ((.cse43 (select .cse42 .cse37))) (let ((.cse49 (select .cse43 .cse44)) (.cse50 (bvadd (_ bv4 32) .cse51))) (let ((.cse40 (select (select .cse42 .cse49) .cse50)) (.cse41 (select (select .cse47 .cse49) .cse50))) (let ((.cse38 (let ((.cse46 (store .cse47 .cse37 (store .cse48 .cse44 .cse41)))) (store .cse46 .cse40 (store (select .cse46 .cse40) .cse41 v_ArrVal_504))))) (let ((.cse45 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse38 (select (select (let ((.cse39 (store .cse42 .cse37 (store .cse43 .cse44 .cse40)))) (store .cse39 .cse40 (store (select .cse39 .cse40) .cse41 v_ArrVal_506))) |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) .cse45)) .cse45)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse52)) (= .cse52 .cse51)))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (v_ArrVal_506 (_ BitVec 32)) (v_ArrVal_504 (_ BitVec 32))) (let ((.cse72 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse62 (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (store .cse73 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse73 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (.cse67 (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (store .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))))) (let ((.cse70 (select (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (select (select .cse62 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse63 (select .cse62 .cse56)) (.cse64 (bvadd (_ bv4 32) .cse70))) (let ((.cse57 (select .cse63 .cse64))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse56)) (= .cse56 .cse57) (let ((.cse68 (select .cse67 .cse56))) (let ((.cse69 (bvadd (_ bv4 32) (select .cse68 .cse64)))) (let ((.cse60 (select (select .cse62 .cse57) .cse69)) (.cse61 (select (select .cse67 .cse57) .cse69))) (let ((.cse58 (let ((.cse66 (store .cse67 .cse56 (store .cse68 .cse64 .cse61)))) (store .cse66 .cse60 (store (select .cse66 .cse60) .cse61 v_ArrVal_504))))) (let ((.cse65 (select (select .cse58 |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse58 (select (select (let ((.cse59 (store .cse62 .cse56 (store .cse63 .cse64 .cse60)))) (store .cse59 .cse60 (store (select .cse59 .cse60) .cse61 v_ArrVal_506))) |c_ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) .cse65)) .cse65)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse70)))))))))) is different from false [2022-07-22 14:53:14,653 WARN L233 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:53:14,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:53:15,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:17,061 INFO L244 Elim1Store]: Index analysis took 101 ms [2022-07-22 14:53:17,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:53:17,214 INFO L190 IndexEqualityManager]: detected not equals via solver