./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:12:05,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:12:05,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:12:05,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:12:05,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:12:05,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:12:05,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:12:05,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:12:05,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:12:05,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:12:05,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:12:05,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:12:05,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:12:05,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:12:05,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:12:05,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:12:05,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:12:05,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:12:05,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:12:05,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:12:05,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:12:05,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:12:05,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:12:05,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:12:05,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:12:05,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:12:05,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:12:05,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:12:05,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:12:05,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:12:05,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:12:05,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:12:05,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:12:05,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:12:05,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:12:05,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:12:05,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:12:05,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:12:05,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:12:05,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:12:05,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:12:05,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:12:05,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:12:05,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:12:05,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:12:05,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:12:05,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:12:05,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:12:05,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:12:05,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:12:05,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:12:05,521 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:12:05,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:12:05,522 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:12:05,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:12:05,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:12:05,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:12:05,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:12:05,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:12:05,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:12:05,524 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:12:05,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:12:05,525 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:12:05,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:12:05,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:12:05,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:12:05,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:12:05,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:05,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:12:05,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:12:05,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:12:05,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:12:05,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:12:05,527 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:12:05,527 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:12:05,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:12:05,527 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2022-07-13 18:12:05,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:12:05,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:12:05,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:12:05,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:12:05,743 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:12:05,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-07-13 18:12:05,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61cf30bf/f18f1a66b834417593d913a9678fbbc3/FLAGa05b391b7 [2022-07-13 18:12:06,198 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:12:06,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-07-13 18:12:06,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61cf30bf/f18f1a66b834417593d913a9678fbbc3/FLAGa05b391b7 [2022-07-13 18:12:06,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61cf30bf/f18f1a66b834417593d913a9678fbbc3 [2022-07-13 18:12:06,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:12:06,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:12:06,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:06,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:12:06,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:12:06,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e35ee58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06, skipping insertion in model container [2022-07-13 18:12:06,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:12:06,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:12:06,783 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/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-07-13 18:12:06,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:06,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:12:06,842 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/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-07-13 18:12:06,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:06,863 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:12:06,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06 WrapperNode [2022-07-13 18:12:06,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:06,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:06,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:12:06,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:12:06,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,887 INFO L137 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 202 [2022-07-13 18:12:06,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:06,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:12:06,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:12:06,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:12:06,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:12:06,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:12:06,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:12:06,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:12:06,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (1/1) ... [2022-07-13 18:12:06,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:06,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:06,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:12:06,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:12:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:12:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-13 18:12:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-13 18:12:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:12:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-13 18:12:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-13 18:12:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-07-13 18:12:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-07-13 18:12:06,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:12:06,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:12:07,016 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:12:07,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:12:07,192 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:12:07,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:12:07,196 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 18:12:07,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:07 BoogieIcfgContainer [2022-07-13 18:12:07,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:12:07,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:12:07,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:12:07,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:12:07,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:12:06" (1/3) ... [2022-07-13 18:12:07,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56284c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:07, skipping insertion in model container [2022-07-13 18:12:07,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:06" (2/3) ... [2022-07-13 18:12:07,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56284c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:07, skipping insertion in model container [2022-07-13 18:12:07,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:07" (3/3) ... [2022-07-13 18:12:07,202 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2022-07-13 18:12:07,211 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:12:07,211 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:12:07,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:12:07,244 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55549d74, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e9c7a5b [2022-07-13 18:12:07,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:12:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 18:12:07,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 18:12:07,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:07,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:07,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -21131724, now seen corresponding path program 1 times [2022-07-13 18:12:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:07,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226475862] [2022-07-13 18:12:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:07,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 18:12:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,519 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-13 18:12:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:07,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226475862] [2022-07-13 18:12:07,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226475862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:07,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:07,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:12:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335916202] [2022-07-13 18:12:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:07,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:12:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:12:07,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:12:07,552 INFO L87 Difference]: Start difference. First operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:12:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:07,671 INFO L93 Difference]: Finished difference Result 214 states and 325 transitions. [2022-07-13 18:12:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:12:07,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-13 18:12:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:07,686 INFO L225 Difference]: With dead ends: 214 [2022-07-13 18:12:07,686 INFO L226 Difference]: Without dead ends: 138 [2022-07-13 18:12:07,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:12:07,690 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:07,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 267 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:12:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-13 18:12:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2022-07-13 18:12:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 118 states have internal predecessors, (160), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-13 18:12:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2022-07-13 18:12:07,731 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 43 [2022-07-13 18:12:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:07,732 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2022-07-13 18:12:07,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:12:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2022-07-13 18:12:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:12:07,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:07,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:07,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:12:07,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1928738726, now seen corresponding path program 1 times [2022-07-13 18:12:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:07,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667536468] [2022-07-13 18:12:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 18:12:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,801 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-13 18:12:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:07,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667536468] [2022-07-13 18:12:07,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667536468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:07,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:07,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:12:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311080286] [2022-07-13 18:12:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:07,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:12:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:12:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:12:07,807 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:12:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:07,871 INFO L93 Difference]: Finished difference Result 380 states and 524 transitions. [2022-07-13 18:12:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:12:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-13 18:12:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:07,874 INFO L225 Difference]: With dead ends: 380 [2022-07-13 18:12:07,874 INFO L226 Difference]: Without dead ends: 256 [2022-07-13 18:12:07,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:12:07,876 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 100 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:07,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 279 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-13 18:12:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2022-07-13 18:12:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 177 states have (on average 1.3785310734463276) internal successors, (244), 179 states have internal predecessors, (244), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2022-07-13 18:12:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 274 transitions. [2022-07-13 18:12:07,893 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 274 transitions. Word has length 44 [2022-07-13 18:12:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:07,894 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 274 transitions. [2022-07-13 18:12:07,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:12:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 274 transitions. [2022-07-13 18:12:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:12:07,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:07,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:07,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:12:07,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1081871109, now seen corresponding path program 1 times [2022-07-13 18:12:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:07,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870100801] [2022-07-13 18:12:07,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 18:12:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,934 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-13 18:12:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:07,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870100801] [2022-07-13 18:12:07,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870100801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:07,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:07,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:12:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539737642] [2022-07-13 18:12:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:07,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:12:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:12:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:12:07,936 INFO L87 Difference]: Start difference. First operand 199 states and 274 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:12:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:08,006 INFO L93 Difference]: Finished difference Result 607 states and 833 transitions. [2022-07-13 18:12:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:12:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-13 18:12:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:08,009 INFO L225 Difference]: With dead ends: 607 [2022-07-13 18:12:08,009 INFO L226 Difference]: Without dead ends: 416 [2022-07-13 18:12:08,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:12:08,011 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 117 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:08,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 253 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-07-13 18:12:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 364. [2022-07-13 18:12:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 323 states have (on average 1.3436532507739938) internal successors, (434), 328 states have internal predecessors, (434), 24 states have call successors, (24), 15 states have call predecessors, (24), 16 states have return successors, (34), 20 states have call predecessors, (34), 22 states have call successors, (34) [2022-07-13 18:12:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 492 transitions. [2022-07-13 18:12:08,033 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 492 transitions. Word has length 44 [2022-07-13 18:12:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:08,033 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 492 transitions. [2022-07-13 18:12:08,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:12:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2022-07-13 18:12:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 18:12:08,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:08,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:08,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:12:08,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1162995804, now seen corresponding path program 1 times [2022-07-13 18:12:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:08,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105135422] [2022-07-13 18:12:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 18:12:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:12:08,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:08,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105135422] [2022-07-13 18:12:08,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105135422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:08,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:08,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:12:08,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217247876] [2022-07-13 18:12:08,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:08,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:12:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:12:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:12:08,102 INFO L87 Difference]: Start difference. First operand 364 states and 492 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:12:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:08,168 INFO L93 Difference]: Finished difference Result 948 states and 1277 transitions. [2022-07-13 18:12:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:12:08,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2022-07-13 18:12:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:08,171 INFO L225 Difference]: With dead ends: 948 [2022-07-13 18:12:08,171 INFO L226 Difference]: Without dead ends: 592 [2022-07-13 18:12:08,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:12:08,173 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 84 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:08,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 334 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-13 18:12:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 554. [2022-07-13 18:12:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 489 states have (on average 1.296523517382413) internal successors, (634), 496 states have internal predecessors, (634), 38 states have call successors, (38), 23 states have call predecessors, (38), 26 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2022-07-13 18:12:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 730 transitions. [2022-07-13 18:12:08,194 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 730 transitions. Word has length 61 [2022-07-13 18:12:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:08,194 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 730 transitions. [2022-07-13 18:12:08,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:12:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 730 transitions. [2022-07-13 18:12:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 18:12:08,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:08,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:08,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:12:08,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1047893343, now seen corresponding path program 1 times [2022-07-13 18:12:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:08,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505870790] [2022-07-13 18:12:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:08,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:12:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:12:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:12:08,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:08,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505870790] [2022-07-13 18:12:08,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505870790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:08,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:08,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:12:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163870213] [2022-07-13 18:12:08,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:08,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:12:08,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:08,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:12:08,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:12:08,250 INFO L87 Difference]: Start difference. First operand 554 states and 730 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 18:12:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:08,333 INFO L93 Difference]: Finished difference Result 1207 states and 1583 transitions. [2022-07-13 18:12:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:12:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-07-13 18:12:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:08,336 INFO L225 Difference]: With dead ends: 1207 [2022-07-13 18:12:08,336 INFO L226 Difference]: Without dead ends: 753 [2022-07-13 18:12:08,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:12:08,337 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:08,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 250 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-07-13 18:12:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 698. [2022-07-13 18:12:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 617 states have (on average 1.2722852512155591) internal successors, (785), 626 states have internal predecessors, (785), 46 states have call successors, (46), 29 states have call predecessors, (46), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2022-07-13 18:12:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 903 transitions. [2022-07-13 18:12:08,358 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 903 transitions. Word has length 66 [2022-07-13 18:12:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:08,359 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 903 transitions. [2022-07-13 18:12:08,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 18:12:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 903 transitions. [2022-07-13 18:12:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:12:08,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:08,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:08,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:12:08,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1099770361, now seen corresponding path program 1 times [2022-07-13 18:12:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400359244] [2022-07-13 18:12:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:12:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 18:12:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400359244] [2022-07-13 18:12:08,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400359244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520302208] [2022-07-13 18:12:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:08,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:08,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:08,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:08,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:12:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 18:12:08,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:08,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 18:12:08,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520302208] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:08,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:12:08,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-07-13 18:12:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979538438] [2022-07-13 18:12:08,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:08,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:12:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:08,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:12:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:08,642 INFO L87 Difference]: Start difference. First operand 698 states and 903 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:12:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:08,717 INFO L93 Difference]: Finished difference Result 754 states and 971 transitions. [2022-07-13 18:12:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:12:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2022-07-13 18:12:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:08,720 INFO L225 Difference]: With dead ends: 754 [2022-07-13 18:12:08,720 INFO L226 Difference]: Without dead ends: 751 [2022-07-13 18:12:08,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:08,721 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:08,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 185 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:12:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-07-13 18:12:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 697. [2022-07-13 18:12:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 617 states have (on average 1.2690437601296596) internal successors, (783), 625 states have internal predecessors, (783), 45 states have call successors, (45), 29 states have call predecessors, (45), 34 states have return successors, (72), 42 states have call predecessors, (72), 44 states have call successors, (72) [2022-07-13 18:12:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 900 transitions. [2022-07-13 18:12:08,748 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 900 transitions. Word has length 67 [2022-07-13 18:12:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:08,748 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 900 transitions. [2022-07-13 18:12:08,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:12:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 900 transitions. [2022-07-13 18:12:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 18:12:08,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:08,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:08,769 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-13 18:12:08,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 18:12:08,965 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash -267180508, now seen corresponding path program 1 times [2022-07-13 18:12:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703000629] [2022-07-13 18:12:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:12:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 18:12:09,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:09,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703000629] [2022-07-13 18:12:09,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703000629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:09,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987538930] [2022-07-13 18:12:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:09,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:09,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:09,060 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-13 18:12:09,061 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-13 18:12:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 18:12:09,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:09,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 18:12:09,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987538930] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:12:09,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:12:09,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-07-13 18:12:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651955791] [2022-07-13 18:12:09,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:09,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 18:12:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 18:12:09,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:09,369 INFO L87 Difference]: Start difference. First operand 697 states and 900 transitions. Second operand has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 18:12:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:10,052 INFO L93 Difference]: Finished difference Result 2397 states and 3120 transitions. [2022-07-13 18:12:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-13 18:12:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 68 [2022-07-13 18:12:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:10,060 INFO L225 Difference]: With dead ends: 2397 [2022-07-13 18:12:10,060 INFO L226 Difference]: Without dead ends: 1853 [2022-07-13 18:12:10,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-07-13 18:12:10,063 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 429 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:10,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1675 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:12:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2022-07-13 18:12:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1086. [2022-07-13 18:12:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 967 states have (on average 1.2585315408479834) internal successors, (1217), 983 states have internal predecessors, (1217), 65 states have call successors, (65), 43 states have call predecessors, (65), 53 states have return successors, (106), 59 states have call predecessors, (106), 64 states have call successors, (106) [2022-07-13 18:12:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1388 transitions. [2022-07-13 18:12:10,132 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1388 transitions. Word has length 68 [2022-07-13 18:12:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:10,133 INFO L495 AbstractCegarLoop]: Abstraction has 1086 states and 1388 transitions. [2022-07-13 18:12:10,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 18:12:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1388 transitions. [2022-07-13 18:12:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 18:12:10,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:10,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:10,157 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-13 18:12:10,352 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,SelfDestructingSolverStorable6 [2022-07-13 18:12:10,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 235450586, now seen corresponding path program 1 times [2022-07-13 18:12:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673882214] [2022-07-13 18:12:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:12:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 18:12:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:12:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 18:12:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:10,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673882214] [2022-07-13 18:12:10,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673882214] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:10,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134742341] [2022-07-13 18:12:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:10,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:10,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:10,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:12:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:12:10,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 18:12:10,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134742341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:10,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:10,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 18:12:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474652626] [2022-07-13 18:12:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:10,539 INFO L87 Difference]: Start difference. First operand 1086 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 18:12:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:10,576 INFO L93 Difference]: Finished difference Result 1809 states and 2326 transitions. [2022-07-13 18:12:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 87 [2022-07-13 18:12:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:10,579 INFO L225 Difference]: With dead ends: 1809 [2022-07-13 18:12:10,579 INFO L226 Difference]: Without dead ends: 964 [2022-07-13 18:12:10,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:10,580 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 53 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:10,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 199 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-07-13 18:12:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 949. [2022-07-13 18:12:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 846 states have (on average 1.25177304964539) internal successors, (1059), 861 states have internal predecessors, (1059), 57 states have call successors, (57), 37 states have call predecessors, (57), 45 states have return successors, (92), 50 states have call predecessors, (92), 56 states have call successors, (92) [2022-07-13 18:12:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1208 transitions. [2022-07-13 18:12:10,621 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1208 transitions. Word has length 87 [2022-07-13 18:12:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:10,621 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1208 transitions. [2022-07-13 18:12:10,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 18:12:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1208 transitions. [2022-07-13 18:12:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 18:12:10,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:10,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:10,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 18:12:10,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:10,840 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1832296466, now seen corresponding path program 1 times [2022-07-13 18:12:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:10,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081980387] [2022-07-13 18:12:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:12:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:12:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 18:12:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 18:12:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:12:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 18:12:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081980387] [2022-07-13 18:12:10,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081980387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390206323] [2022-07-13 18:12:10,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:10,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:10,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:10,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:10,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:12:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:10,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:10,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 18:12:11,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:11,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390206323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:11,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:11,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 18:12:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455904780] [2022-07-13 18:12:11,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:11,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:11,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:11,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:11,020 INFO L87 Difference]: Start difference. First operand 949 states and 1208 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 18:12:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:11,045 INFO L93 Difference]: Finished difference Result 1328 states and 1676 transitions. [2022-07-13 18:12:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:11,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 102 [2022-07-13 18:12:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:11,045 INFO L225 Difference]: With dead ends: 1328 [2022-07-13 18:12:11,045 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 18:12:11,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:11,050 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 62 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:11,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 206 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 18:12:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 18:12:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 18:12:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 18:12:11,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2022-07-13 18:12:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:11,051 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 18:12:11,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 18:12:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 18:12:11,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 18:12:11,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:12:11,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 18:12:11,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:11,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L895 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 76 100) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse2 (not (= ~q_free~0 0)))) (and (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse0 (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) .cse2) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or (not (= 2 |old(~c_dr_st~0)|)) .cse0 .cse1 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))))) [2022-07-13 18:12:13,645 INFO L895 garLoopResultBuilder]: At program point L54(lines 38 56) the Hoare annotation is: (let ((.cse10 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse2 (not (= 2 |old(~c_dr_st~0)|))) (.cse0 (and .cse10 .cse11)) (.cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse4 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse5 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse6 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse8 (not (= ~q_free~0 0)))) (and (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse1 .cse8 .cse9) (or .cse2 .cse0 .cse1 .cse8 .cse9) (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse7 .cse1 (and .cse10 .cse3 .cse11 .cse4 .cse5 .cse6) (not (= ~c_num_read~0 0)) .cse8)))) [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 76 100) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L895 garLoopResultBuilder]: At program point L73(lines 57 75) the Hoare annotation is: (let ((.cse2 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse4 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse5 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse7 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (= ~p_dw_st~0 0)) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse6 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse8 .cse9 (not (= ~c_num_read~0 0)) .cse10) (or .cse11 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse12) (or .cse11 .cse9 .cse10 (and (= ~c_dr_st~0 2) (or .cse0 .cse13)) .cse12) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse9 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 (and .cse0 .cse1 .cse3 .cse6) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 76 100) no Hoare annotation was computed. [2022-07-13 18:12:13,645 INFO L895 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse8 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (= 2 |old(~c_dr_st~0)|))) (.cse7 (and .cse8 .cse9)) (.cse6 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse1 (not (= ~p_dw_pc~0 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~q_free~0 0))) (.cse3 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse4 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4) .cse5 .cse6) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse7 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse0 .cse7 .cse2 .cse5 .cse6) (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse1 .cse2 (not (= ~c_num_read~0 0)) .cse5 (and .cse8 .cse3 .cse9 .cse4))))) [2022-07-13 18:12:13,645 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L895 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse2 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse4 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse5 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse7 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= ~q_free~0 0))) (.cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (= ~p_dw_st~0 0)) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse6 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse8 .cse9 (not (= ~c_num_read~0 0)) .cse10) (or .cse11 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse12) (or .cse11 .cse9 .cse10 (and (= ~c_dr_st~0 2) (or .cse0 .cse13)) .cse12) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse9 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 (and .cse0 .cse1 .cse3 .cse6) (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 220 239) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 220 239) the Hoare annotation is: true [2022-07-13 18:12:13,646 INFO L902 garLoopResultBuilder]: At program point L236(lines 223 238) the Hoare annotation is: true [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 220 239) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-07-13 18:12:13,646 INFO L895 garLoopResultBuilder]: At program point L192-1(lines 148 200) the Hoare annotation is: (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~q_free~0 0) .cse1) (and .cse2 .cse0 .cse3 (= ~p_dw_st~0 0) .cse4) (and .cse2 .cse0 .cse3 .cse4 .cse1))) [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L250(line 250) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L895 garLoopResultBuilder]: At program point L300(line 300) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L300-1(line 300) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2022-07-13 18:12:13,646 INFO L895 garLoopResultBuilder]: At program point L119(lines 105 142) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0))) (or (and (= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_st~0 2) .cse0) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 (= ~c_dr_pc~0 0)))) [2022-07-13 18:12:13,646 INFO L895 garLoopResultBuilder]: At program point L309(lines 298 311) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L153(lines 148 200) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~q_free~0 0) (<= 2 ~p_dw_st~0)) [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L310(lines 294 312) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L211-1(lines 202 219) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 1)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0)))) [2022-07-13 18:12:13,647 INFO L902 garLoopResultBuilder]: At program point L368(lines 359 370) the Hoare annotation is: true [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~p_dw_st~0)) [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L902 garLoopResultBuilder]: At program point L336(lines 313 341) the Hoare annotation is: true [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L138(lines 101 143) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2))) [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L196(lines 145 201) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~p_dw_st~0)))) [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2022-07-13 18:12:13,647 INFO L895 garLoopResultBuilder]: At program point L288(lines 240 293) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2022-07-13 18:12:13,647 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L895 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L895 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L895 garLoopResultBuilder]: At program point L356(lines 342 358) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 2)) (.cse1 (= ~q_free~0 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse3 .cse4 .cse0 .cse5 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse10 .cse11) (and .cse4 .cse0 .cse1 .cse2) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse10 .cse11 .cse2))) [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L895 garLoopResultBuilder]: At program point L117-1(lines 105 142) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0)) (and .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3))) [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L895 garLoopResultBuilder]: At program point L134(line 134) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 (= ~c_dr_pc~0 0) (= ~p_num_write~0 1)))) [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point L324(line 324) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-13 18:12:13,648 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-07-13 18:12:13,648 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-07-13 18:12:13,650 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:13,652 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:12:13,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:12:13 BoogieIcfgContainer [2022-07-13 18:12:13,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:12:13,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:12:13,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:12:13,673 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:12:13,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:07" (3/4) ... [2022-07-13 18:12:13,675 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 18:12:13,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-07-13 18:12:13,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-07-13 18:12:13,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-07-13 18:12:13,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-07-13 18:12:13,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 18:12:13,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 18:12:13,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 18:12:13,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(2 == \old(c_dr_st)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write)) && (((((!(2 <= \old(p_dw_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && ((((!(2 == \old(c_dr_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) [2022-07-13 18:12:13,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(2 <= \old(p_dw_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((!(2 == \old(c_dr_st)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((!(2 == \old(c_dr_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(c_num_read == 0)) || !(q_free == 0)) [2022-07-13 18:12:13,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) && (((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((!(2 == \old(c_dr_st)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(c_num_read + 1 == p_num_write))) && ((((((!(2 <= \old(p_dw_st)) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2022-07-13 18:12:13,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) && (((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((!(2 == \old(c_dr_st)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(c_num_read + 1 == p_num_write))) && ((((((!(2 <= \old(p_dw_st)) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) [2022-07-13 18:12:13,712 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:12:13,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:12:13,712 INFO L158 Benchmark]: Toolchain (without parser) took 7111.46ms. Allocated memory was 83.9MB in the beginning and 148.9MB in the end (delta: 65.0MB). Free memory was 58.3MB in the beginning and 58.6MB in the end (delta: -270.6kB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2022-07-13 18:12:13,712 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:12:13,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.97ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 58.7MB in the end (delta: -549.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 18:12:13,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.99ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 56.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:12:13,713 INFO L158 Benchmark]: Boogie Preprocessor took 22.72ms. Allocated memory is still 83.9MB. Free memory was 56.6MB in the beginning and 55.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:12:13,713 INFO L158 Benchmark]: RCFGBuilder took 284.79ms. Allocated memory is still 83.9MB. Free memory was 55.3MB in the beginning and 41.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 18:12:13,713 INFO L158 Benchmark]: TraceAbstraction took 6473.99ms. Allocated memory was 83.9MB in the beginning and 148.9MB in the end (delta: 65.0MB). Free memory was 41.3MB in the beginning and 63.8MB in the end (delta: -22.6MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2022-07-13 18:12:13,714 INFO L158 Benchmark]: Witness Printer took 38.83ms. Allocated memory is still 148.9MB. Free memory was 63.8MB in the beginning and 58.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 18:12:13,715 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.97ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 58.7MB in the end (delta: -549.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.99ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 56.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.72ms. Allocated memory is still 83.9MB. Free memory was 56.6MB in the beginning and 55.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.79ms. Allocated memory is still 83.9MB. Free memory was 55.3MB in the beginning and 41.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6473.99ms. Allocated memory was 83.9MB in the beginning and 148.9MB in the end (delta: 65.0MB). Free memory was 41.3MB in the beginning and 63.8MB in the end (delta: -22.6MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Witness Printer took 38.83ms. Allocated memory is still 148.9MB. Free memory was 63.8MB in the beginning and 58.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1239 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1226 mSDsluCounter, 3648 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2383 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 767 IncrementalHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 1265 mSDtfsCounter, 767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 531 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1086occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 722 PreInvPairs, 898 NumberOfFragments, 1804 HoareAnnotationTreeSize, 722 FomulaSimplifications, 1028 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 10284 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1026 ConstructedInterpolants, 0 QuantifiedInterpolants, 1996 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1142 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 270/342 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) || ((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_dr_pc == 0) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((!(2 == \old(c_dr_st)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write)) && (((((!(2 <= \old(p_dw_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && ((((!(2 == \old(c_dr_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0)) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0)) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) && (((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((!(2 == \old(c_dr_st)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(c_num_read + 1 == p_num_write))) && ((((((!(2 <= \old(p_dw_st)) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((!(2 <= \old(p_dw_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(q_free == 1)) || !(c_last_read == p_last_write)) && (((((!(2 == \old(c_dr_st)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((!(2 == \old(c_dr_st)) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(c_num_read == 0)) || !(q_free == 0)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0)) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0)) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) && (((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_num_read + 1 == p_num_write))) && ((((!(2 == \old(c_dr_st)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(c_num_read + 1 == p_num_write))) && ((((((!(2 <= \old(p_dw_st)) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) || ((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0)) || ((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st) || ((((c_num_read == p_num_write && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((c_num_read == p_num_write && p_last_write == q_buf_0) && q_free == 1) && c_last_read == p_last_write) && 2 <= p_dw_st) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st) || (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && 2 <= p_dw_st) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && q_free == 0) && 2 <= p_dw_st) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0)) || ((((c_num_read == p_num_write && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && 2 <= p_dw_st)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) RESULT: Ultimate proved your program to be correct! [2022-07-13 18:12:13,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE