./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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_2.cil-1.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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 11:43:00,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 11:43:00,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 11:43:00,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 11:43:00,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 11:43:00,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 11:43:00,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 11:43:00,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 11:43:00,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 11:43:00,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 11:43:00,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 11:43:00,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 11:43:00,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 11:43:00,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 11:43:00,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 11:43:00,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 11:43:00,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 11:43:00,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 11:43:00,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 11:43:00,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 11:43:00,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 11:43:00,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 11:43:00,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 11:43:00,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 11:43:00,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 11:43:00,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 11:43:00,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 11:43:00,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 11:43:00,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 11:43:00,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 11:43:00,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 11:43:00,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 11:43:00,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 11:43:00,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 11:43:00,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 11:43:00,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 11:43:00,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 11:43:00,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 11:43:00,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 11:43:00,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 11:43:00,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 11:43:00,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 11:43:00,237 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 11:43:00,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 11:43:00,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 11:43:00,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 11:43:00,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 11:43:00,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 11:43:00,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 11:43:00,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 11:43:00,242 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 11:43:00,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 11:43:00,242 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 11:43:00,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 11:43:00,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 11:43:00,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 11:43:00,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 11:43:00,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 11:43:00,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 11:43:00,243 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 11:43:00,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 11:43:00,243 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 11:43:00,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 11:43:00,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 11:43:00,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 11:43:00,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 11:43:00,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:43:00,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 11:43:00,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 11:43:00,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 11:43:00,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 11:43:00,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 11:43:00,245 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 11:43:00,246 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 11:43:00,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 11:43:00,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 11:43:00,246 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2021-12-22 11:43:00,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 11:43:00,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 11:43:00,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 11:43:00,466 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 11:43:00,467 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 11:43:00,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-12-22 11:43:00,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b04eee6c/1066754bfbd14c0e9851279e142cf748/FLAG12c56a052 [2021-12-22 11:43:00,903 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 11:43:00,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-12-22 11:43:00,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b04eee6c/1066754bfbd14c0e9851279e142cf748/FLAG12c56a052 [2021-12-22 11:43:01,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b04eee6c/1066754bfbd14c0e9851279e142cf748 [2021-12-22 11:43:01,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 11:43:01,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 11:43:01,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 11:43:01,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 11:43:01,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 11:43:01,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c0ac02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01, skipping insertion in model container [2021-12-22 11:43:01,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 11:43:01,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 11:43:01,475 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_2.cil-1.c[643,656] [2021-12-22 11:43:01,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:43:01,518 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 11:43:01,532 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_2.cil-1.c[643,656] [2021-12-22 11:43:01,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:43:01,568 INFO L208 MainTranslator]: Completed translation [2021-12-22 11:43:01,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01 WrapperNode [2021-12-22 11:43:01,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 11:43:01,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 11:43:01,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 11:43:01,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 11:43:01,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,599 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2021-12-22 11:43:01,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 11:43:01,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 11:43:01,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 11:43:01,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 11:43:01,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 11:43:01,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 11:43:01,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 11:43:01,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 11:43:01,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (1/1) ... [2021-12-22 11:43:01,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:43:01,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:01,671 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) [2021-12-22 11:43:01,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 11:43:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 11:43:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-22 11:43:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-22 11:43:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-22 11:43:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-22 11:43:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-22 11:43:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-22 11:43:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-22 11:43:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-22 11:43:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-22 11:43:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-22 11:43:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-22 11:43:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-22 11:43:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 11:43:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-22 11:43:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-22 11:43:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 11:43:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 11:43:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-22 11:43:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-22 11:43:01,782 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 11:43:01,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 11:43:02,030 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 11:43:02,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 11:43:02,042 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-22 11:43:02,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:43:02 BoogieIcfgContainer [2021-12-22 11:43:02,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 11:43:02,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 11:43:02,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 11:43:02,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 11:43:02,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:43:01" (1/3) ... [2021-12-22 11:43:02,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335944c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:43:02, skipping insertion in model container [2021-12-22 11:43:02,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:43:01" (2/3) ... [2021-12-22 11:43:02,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335944c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:43:02, skipping insertion in model container [2021-12-22 11:43:02,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:43:02" (3/3) ... [2021-12-22 11:43:02,064 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-12-22 11:43:02,068 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 11:43:02,069 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 11:43:02,107 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 11:43:02,125 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 11:43:02,131 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 11:43:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-22 11:43:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:02,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:02,151 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:02,151 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:02,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2021-12-22 11:43:02,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769067440] [2021-12-22 11:43:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:02,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:02,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:02,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769067440] [2021-12-22 11:43:02,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769067440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:02,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:02,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 11:43:02,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351300092] [2021-12-22 11:43:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:02,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 11:43:02,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 11:43:02,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 11:43:02,415 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:02,625 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2021-12-22 11:43:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 11:43:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-22 11:43:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:02,639 INFO L225 Difference]: With dead ends: 215 [2021-12-22 11:43:02,640 INFO L226 Difference]: Without dead ends: 115 [2021-12-22 11:43:02,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-22 11:43:02,646 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 209 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:02,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 299 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:43:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-22 11:43:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2021-12-22 11:43:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-22 11:43:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2021-12-22 11:43:02,696 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2021-12-22 11:43:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:02,696 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2021-12-22 11:43:02,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2021-12-22 11:43:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:02,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:02,699 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:02,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 11:43:02,699 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2021-12-22 11:43:02,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:02,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634082574] [2021-12-22 11:43:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:02,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:02,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634082574] [2021-12-22 11:43:02,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634082574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:02,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:02,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 11:43:02,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091219067] [2021-12-22 11:43:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:02,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 11:43:02,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 11:43:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:02,866 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:03,293 INFO L93 Difference]: Finished difference Result 320 states and 445 transitions. [2021-12-22 11:43:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 11:43:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-22 11:43:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:03,296 INFO L225 Difference]: With dead ends: 320 [2021-12-22 11:43:03,296 INFO L226 Difference]: Without dead ends: 232 [2021-12-22 11:43:03,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-22 11:43:03,298 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 399 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:03,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 432 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:43:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-22 11:43:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2021-12-22 11:43:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2021-12-22 11:43:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2021-12-22 11:43:03,317 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2021-12-22 11:43:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:03,317 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2021-12-22 11:43:03,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2021-12-22 11:43:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:03,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:03,319 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:03,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 11:43:03,319 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2021-12-22 11:43:03,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195238182] [2021-12-22 11:43:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:03,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:03,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195238182] [2021-12-22 11:43:03,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195238182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:03,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:03,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 11:43:03,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840405173] [2021-12-22 11:43:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:03,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 11:43:03,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 11:43:03,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:03,411 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:03,800 INFO L93 Difference]: Finished difference Result 540 states and 738 transitions. [2021-12-22 11:43:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 11:43:03,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-22 11:43:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:03,804 INFO L225 Difference]: With dead ends: 540 [2021-12-22 11:43:03,804 INFO L226 Difference]: Without dead ends: 363 [2021-12-22 11:43:03,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-22 11:43:03,806 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 446 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:03,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 691 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:43:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-22 11:43:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2021-12-22 11:43:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2021-12-22 11:43:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2021-12-22 11:43:03,829 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2021-12-22 11:43:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:03,829 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2021-12-22 11:43:03,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2021-12-22 11:43:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:03,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:03,832 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:03,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 11:43:03,832 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2021-12-22 11:43:03,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:03,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582592937] [2021-12-22 11:43:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:03,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:03,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:03,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582592937] [2021-12-22 11:43:03,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582592937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:03,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:03,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 11:43:03,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765112356] [2021-12-22 11:43:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:03,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 11:43:03,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 11:43:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:03,937 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 11:43:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:04,239 INFO L93 Difference]: Finished difference Result 590 states and 809 transitions. [2021-12-22 11:43:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 11:43:04,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2021-12-22 11:43:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:04,241 INFO L225 Difference]: With dead ends: 590 [2021-12-22 11:43:04,241 INFO L226 Difference]: Without dead ends: 323 [2021-12-22 11:43:04,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 11:43:04,243 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 114 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:04,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 604 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-22 11:43:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2021-12-22 11:43:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2021-12-22 11:43:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2021-12-22 11:43:04,295 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2021-12-22 11:43:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:04,296 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2021-12-22 11:43:04,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 11:43:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2021-12-22 11:43:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:04,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:04,301 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:04,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 11:43:04,301 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2021-12-22 11:43:04,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:04,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444216096] [2021-12-22 11:43:04,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:04,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:04,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:04,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444216096] [2021-12-22 11:43:04,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444216096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:04,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:04,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 11:43:04,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295328665] [2021-12-22 11:43:04,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:04,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 11:43:04,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 11:43:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:04,416 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-22 11:43:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:05,485 INFO L93 Difference]: Finished difference Result 1956 states and 2670 transitions. [2021-12-22 11:43:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 11:43:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-12-22 11:43:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:05,495 INFO L225 Difference]: With dead ends: 1956 [2021-12-22 11:43:05,495 INFO L226 Difference]: Without dead ends: 1684 [2021-12-22 11:43:05,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-22 11:43:05,501 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 1150 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:05,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1167 Valid, 930 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 11:43:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2021-12-22 11:43:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1434. [2021-12-22 11:43:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2021-12-22 11:43:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1882 transitions. [2021-12-22 11:43:05,563 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1882 transitions. Word has length 64 [2021-12-22 11:43:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:05,563 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1882 transitions. [2021-12-22 11:43:05,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-22 11:43:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1882 transitions. [2021-12-22 11:43:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:05,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:05,564 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:05,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 11:43:05,565 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2021-12-22 11:43:05,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:05,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701146026] [2021-12-22 11:43:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:05,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:05,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:05,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701146026] [2021-12-22 11:43:05,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701146026] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:05,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:05,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 11:43:05,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074048272] [2021-12-22 11:43:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:05,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 11:43:05,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 11:43:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:05,665 INFO L87 Difference]: Start difference. First operand 1434 states and 1882 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 11:43:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:05,990 INFO L93 Difference]: Finished difference Result 3035 states and 4006 transitions. [2021-12-22 11:43:05,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 11:43:05,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2021-12-22 11:43:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:05,996 INFO L225 Difference]: With dead ends: 3035 [2021-12-22 11:43:05,997 INFO L226 Difference]: Without dead ends: 1623 [2021-12-22 11:43:06,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 11:43:06,027 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 112 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:06,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 597 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-12-22 11:43:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1479. [2021-12-22 11:43:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2021-12-22 11:43:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1921 transitions. [2021-12-22 11:43:06,137 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1921 transitions. Word has length 64 [2021-12-22 11:43:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:06,137 INFO L470 AbstractCegarLoop]: Abstraction has 1479 states and 1921 transitions. [2021-12-22 11:43:06,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 11:43:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1921 transitions. [2021-12-22 11:43:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:06,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:06,138 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:06,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 11:43:06,139 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2021-12-22 11:43:06,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:06,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523738372] [2021-12-22 11:43:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:06,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:06,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523738372] [2021-12-22 11:43:06,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523738372] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:06,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:06,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 11:43:06,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772482000] [2021-12-22 11:43:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:06,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 11:43:06,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 11:43:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:06,229 INFO L87 Difference]: Start difference. First operand 1479 states and 1921 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:06,687 INFO L93 Difference]: Finished difference Result 2914 states and 3760 transitions. [2021-12-22 11:43:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 11:43:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-22 11:43:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:06,693 INFO L225 Difference]: With dead ends: 2914 [2021-12-22 11:43:06,693 INFO L226 Difference]: Without dead ends: 1677 [2021-12-22 11:43:06,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-22 11:43:06,696 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 332 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:06,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 517 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:43:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2021-12-22 11:43:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1457. [2021-12-22 11:43:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2021-12-22 11:43:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1881 transitions. [2021-12-22 11:43:06,768 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1881 transitions. Word has length 64 [2021-12-22 11:43:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:06,768 INFO L470 AbstractCegarLoop]: Abstraction has 1457 states and 1881 transitions. [2021-12-22 11:43:06,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1881 transitions. [2021-12-22 11:43:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 11:43:06,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:06,770 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:06,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 11:43:06,770 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2021-12-22 11:43:06,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:06,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520048177] [2021-12-22 11:43:06,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:06,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:06,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:06,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520048177] [2021-12-22 11:43:06,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520048177] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:06,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:06,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 11:43:06,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912012730] [2021-12-22 11:43:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:06,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 11:43:06,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:06,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 11:43:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 11:43:06,823 INFO L87 Difference]: Start difference. First operand 1457 states and 1881 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:07,135 INFO L93 Difference]: Finished difference Result 4532 states and 5857 transitions. [2021-12-22 11:43:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 11:43:07,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2021-12-22 11:43:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:07,145 INFO L225 Difference]: With dead ends: 4532 [2021-12-22 11:43:07,146 INFO L226 Difference]: Without dead ends: 3100 [2021-12-22 11:43:07,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-22 11:43:07,149 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 295 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:07,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 377 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2021-12-22 11:43:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2828. [2021-12-22 11:43:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2021-12-22 11:43:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3619 transitions. [2021-12-22 11:43:07,268 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3619 transitions. Word has length 64 [2021-12-22 11:43:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:07,269 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3619 transitions. [2021-12-22 11:43:07,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 11:43:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3619 transitions. [2021-12-22 11:43:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 11:43:07,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:07,270 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:07,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 11:43:07,270 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2021-12-22 11:43:07,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:07,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340358375] [2021-12-22 11:43:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:07,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:07,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:07,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340358375] [2021-12-22 11:43:07,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340358375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:07,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:07,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 11:43:07,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533690691] [2021-12-22 11:43:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:07,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 11:43:07,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 11:43:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 11:43:07,318 INFO L87 Difference]: Start difference. First operand 2828 states and 3619 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 11:43:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:07,632 INFO L93 Difference]: Finished difference Result 7846 states and 10129 transitions. [2021-12-22 11:43:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 11:43:07,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-22 11:43:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:07,651 INFO L225 Difference]: With dead ends: 7846 [2021-12-22 11:43:07,651 INFO L226 Difference]: Without dead ends: 5022 [2021-12-22 11:43:07,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-22 11:43:07,658 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:07,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 298 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:43:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2021-12-22 11:43:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4506. [2021-12-22 11:43:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2021-12-22 11:43:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5736 transitions. [2021-12-22 11:43:07,845 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5736 transitions. Word has length 65 [2021-12-22 11:43:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:07,845 INFO L470 AbstractCegarLoop]: Abstraction has 4506 states and 5736 transitions. [2021-12-22 11:43:07,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 11:43:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5736 transitions. [2021-12-22 11:43:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-22 11:43:07,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:07,847 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2021-12-22 11:43:07,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 11:43:07,847 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2021-12-22 11:43:07,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:07,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750551450] [2021-12-22 11:43:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:07,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:07,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:07,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750551450] [2021-12-22 11:43:07,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750551450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:07,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:07,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 11:43:07,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694245187] [2021-12-22 11:43:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:07,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 11:43:07,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 11:43:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 11:43:07,897 INFO L87 Difference]: Start difference. First operand 4506 states and 5736 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-22 11:43:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:08,267 INFO L93 Difference]: Finished difference Result 6136 states and 7738 transitions. [2021-12-22 11:43:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 11:43:08,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2021-12-22 11:43:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:08,289 INFO L225 Difference]: With dead ends: 6136 [2021-12-22 11:43:08,289 INFO L226 Difference]: Without dead ends: 6133 [2021-12-22 11:43:08,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-22 11:43:08,293 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 549 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:08,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 281 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-12-22 11:43:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5560. [2021-12-22 11:43:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2021-12-22 11:43:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 7025 transitions. [2021-12-22 11:43:08,531 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 7025 transitions. Word has length 72 [2021-12-22 11:43:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:08,532 INFO L470 AbstractCegarLoop]: Abstraction has 5560 states and 7025 transitions. [2021-12-22 11:43:08,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-22 11:43:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 7025 transitions. [2021-12-22 11:43:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-22 11:43:08,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:08,533 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2021-12-22 11:43:08,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 11:43:08,534 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1866244794, now seen corresponding path program 1 times [2021-12-22 11:43:08,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733121542] [2021-12-22 11:43:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:08,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:08,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:08,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733121542] [2021-12-22 11:43:08,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733121542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:43:08,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347792131] [2021-12-22 11:43:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:08,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:08,641 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) [2021-12-22 11:43:08,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 11:43:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:08,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 11:43:08,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:43:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:09,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:43:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:09,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347792131] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:43:09,362 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:43:09,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-22 11:43:09,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526816997] [2021-12-22 11:43:09,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:43:09,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 11:43:09,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:09,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 11:43:09,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 11:43:09,363 INFO L87 Difference]: Start difference. First operand 5560 states and 7025 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-22 11:43:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:10,658 INFO L93 Difference]: Finished difference Result 13206 states and 16553 transitions. [2021-12-22 11:43:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-22 11:43:10,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 73 [2021-12-22 11:43:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:10,720 INFO L225 Difference]: With dead ends: 13206 [2021-12-22 11:43:10,720 INFO L226 Difference]: Without dead ends: 13203 [2021-12-22 11:43:10,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-22 11:43:10,730 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 1021 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:10,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 825 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 11:43:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2021-12-22 11:43:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 10818. [2021-12-22 11:43:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10818 states, 8399 states have (on average 1.249315394689844) internal successors, (10493), 8508 states have internal predecessors, (10493), 1191 states have call successors, (1191), 1025 states have call predecessors, (1191), 1227 states have return successors, (1955), 1290 states have call predecessors, (1955), 1190 states have call successors, (1955) [2021-12-22 11:43:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 13639 transitions. [2021-12-22 11:43:11,295 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 13639 transitions. Word has length 73 [2021-12-22 11:43:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:11,296 INFO L470 AbstractCegarLoop]: Abstraction has 10818 states and 13639 transitions. [2021-12-22 11:43:11,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-22 11:43:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 13639 transitions. [2021-12-22 11:43:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-22 11:43:11,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:11,299 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 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] [2021-12-22 11:43:11,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 11:43:11,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-22 11:43:11,515 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1600677641, now seen corresponding path program 2 times [2021-12-22 11:43:11,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:11,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635405733] [2021-12-22 11:43:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:11,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:43:11,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:11,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635405733] [2021-12-22 11:43:11,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635405733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:11,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:11,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 11:43:11,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142525795] [2021-12-22 11:43:11,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:11,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 11:43:11,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 11:43:11,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 11:43:11,565 INFO L87 Difference]: Start difference. First operand 10818 states and 13639 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-22 11:43:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:12,131 INFO L93 Difference]: Finished difference Result 17361 states and 21981 transitions. [2021-12-22 11:43:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 11:43:12,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 76 [2021-12-22 11:43:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:12,164 INFO L225 Difference]: With dead ends: 17361 [2021-12-22 11:43:12,165 INFO L226 Difference]: Without dead ends: 7423 [2021-12-22 11:43:12,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 11:43:12,190 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 202 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:12,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 458 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:43:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2021-12-22 11:43:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 6871. [2021-12-22 11:43:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6871 states, 5346 states have (on average 1.222035166479611) internal successors, (6533), 5411 states have internal predecessors, (6533), 758 states have call successors, (758), 649 states have call predecessors, (758), 766 states have return successors, (1174), 816 states have call predecessors, (1174), 757 states have call successors, (1174) [2021-12-22 11:43:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6871 states to 6871 states and 8465 transitions. [2021-12-22 11:43:12,579 INFO L78 Accepts]: Start accepts. Automaton has 6871 states and 8465 transitions. Word has length 76 [2021-12-22 11:43:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:12,580 INFO L470 AbstractCegarLoop]: Abstraction has 6871 states and 8465 transitions. [2021-12-22 11:43:12,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-22 11:43:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6871 states and 8465 transitions. [2021-12-22 11:43:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-22 11:43:12,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:12,583 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:12,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 11:43:12,583 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1691663828, now seen corresponding path program 1 times [2021-12-22 11:43:12,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538063076] [2021-12-22 11:43:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:12,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 11:43:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-22 11:43:12,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:12,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538063076] [2021-12-22 11:43:12,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538063076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:12,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:12,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 11:43:12,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571639624] [2021-12-22 11:43:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:12,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 11:43:12,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 11:43:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:12,657 INFO L87 Difference]: Start difference. First operand 6871 states and 8465 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 11:43:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:13,613 INFO L93 Difference]: Finished difference Result 20729 states and 25646 transitions. [2021-12-22 11:43:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 11:43:13,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2021-12-22 11:43:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:13,657 INFO L225 Difference]: With dead ends: 20729 [2021-12-22 11:43:13,657 INFO L226 Difference]: Without dead ends: 13886 [2021-12-22 11:43:13,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-22 11:43:13,678 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 715 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:13,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 465 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 11:43:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13886 states. [2021-12-22 11:43:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13886 to 13027. [2021-12-22 11:43:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13027 states, 10018 states have (on average 1.19944100618886) internal successors, (12016), 10185 states have internal predecessors, (12016), 1462 states have call successors, (1462), 1253 states have call predecessors, (1462), 1546 states have return successors, (2563), 1594 states have call predecessors, (2563), 1461 states have call successors, (2563) [2021-12-22 11:43:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 16041 transitions. [2021-12-22 11:43:14,211 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 16041 transitions. Word has length 83 [2021-12-22 11:43:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:14,211 INFO L470 AbstractCegarLoop]: Abstraction has 13027 states and 16041 transitions. [2021-12-22 11:43:14,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 11:43:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 16041 transitions. [2021-12-22 11:43:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-22 11:43:14,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:14,217 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 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] [2021-12-22 11:43:14,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 11:43:14,217 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:14,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647019, now seen corresponding path program 1 times [2021-12-22 11:43:14,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:14,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828794170] [2021-12-22 11:43:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:14,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 11:43:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 11:43:14,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828794170] [2021-12-22 11:43:14,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828794170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:14,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:14,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 11:43:14,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515946265] [2021-12-22 11:43:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:14,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 11:43:14,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:14,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 11:43:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:14,303 INFO L87 Difference]: Start difference. First operand 13027 states and 16041 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 11:43:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:15,314 INFO L93 Difference]: Finished difference Result 23901 states and 29354 transitions. [2021-12-22 11:43:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 11:43:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2021-12-22 11:43:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:15,356 INFO L225 Difference]: With dead ends: 23901 [2021-12-22 11:43:15,357 INFO L226 Difference]: Without dead ends: 11510 [2021-12-22 11:43:15,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-22 11:43:15,392 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 1035 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:15,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 520 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 11:43:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2021-12-22 11:43:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 10610. [2021-12-22 11:43:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 8186 states have (on average 1.1887368678231127) internal successors, (9731), 8322 states have internal predecessors, (9731), 1169 states have call successors, (1169), 1002 states have call predecessors, (1169), 1254 states have return successors, (1902), 1291 states have call predecessors, (1902), 1168 states have call successors, (1902) [2021-12-22 11:43:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 12802 transitions. [2021-12-22 11:43:16,117 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 12802 transitions. Word has length 92 [2021-12-22 11:43:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:16,117 INFO L470 AbstractCegarLoop]: Abstraction has 10610 states and 12802 transitions. [2021-12-22 11:43:16,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 11:43:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 12802 transitions. [2021-12-22 11:43:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-22 11:43:16,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:16,129 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:16,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 11:43:16,130 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 578230399, now seen corresponding path program 1 times [2021-12-22 11:43:16,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:16,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477512261] [2021-12-22 11:43:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:16,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 11:43:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 11:43:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-22 11:43:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-22 11:43:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-22 11:43:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-22 11:43:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-22 11:43:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-22 11:43:16,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:16,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477512261] [2021-12-22 11:43:16,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477512261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:43:16,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806719490] [2021-12-22 11:43:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:16,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:16,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:16,279 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) [2021-12-22 11:43:16,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 11:43:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:16,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 11:43:16,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:43:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 11:43:16,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 11:43:16,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806719490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:16,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 11:43:16,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-22 11:43:16,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142479715] [2021-12-22 11:43:16,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:16,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 11:43:16,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 11:43:16,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-22 11:43:16,540 INFO L87 Difference]: Start difference. First operand 10610 states and 12802 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-22 11:43:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:16,794 INFO L93 Difference]: Finished difference Result 15682 states and 18945 transitions. [2021-12-22 11:43:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 11:43:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2021-12-22 11:43:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:16,812 INFO L225 Difference]: With dead ends: 15682 [2021-12-22 11:43:16,813 INFO L226 Difference]: Without dead ends: 5100 [2021-12-22 11:43:16,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-22 11:43:16,836 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 34 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:16,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 608 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 11:43:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2021-12-22 11:43:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4667. [2021-12-22 11:43:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3699 states have (on average 1.1732900783995674) internal successors, (4340), 3735 states have internal predecessors, (4340), 467 states have call successors, (467), 386 states have call predecessors, (467), 500 states have return successors, (738), 545 states have call predecessors, (738), 466 states have call successors, (738) [2021-12-22 11:43:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 5545 transitions. [2021-12-22 11:43:17,118 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 5545 transitions. Word has length 144 [2021-12-22 11:43:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:17,118 INFO L470 AbstractCegarLoop]: Abstraction has 4667 states and 5545 transitions. [2021-12-22 11:43:17,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-22 11:43:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 5545 transitions. [2021-12-22 11:43:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-22 11:43:17,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:17,125 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:17,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 11:43:17,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-22 11:43:17,341 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash -371595989, now seen corresponding path program 1 times [2021-12-22 11:43:17,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:17,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632666093] [2021-12-22 11:43:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:17,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 11:43:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 11:43:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 11:43:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-22 11:43:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:43:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-22 11:43:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-22 11:43:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-22 11:43:17,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:17,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632666093] [2021-12-22 11:43:17,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632666093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:17,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:17,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 11:43:17,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933289914] [2021-12-22 11:43:17,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:17,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 11:43:17,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 11:43:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 11:43:17,409 INFO L87 Difference]: Start difference. First operand 4667 states and 5545 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-22 11:43:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:17,626 INFO L93 Difference]: Finished difference Result 5210 states and 6157 transitions. [2021-12-22 11:43:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 11:43:17,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 146 [2021-12-22 11:43:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:17,635 INFO L225 Difference]: With dead ends: 5210 [2021-12-22 11:43:17,635 INFO L226 Difference]: Without dead ends: 4461 [2021-12-22 11:43:17,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 11:43:17,637 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 215 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:17,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 248 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:43:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2021-12-22 11:43:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 4242. [2021-12-22 11:43:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4242 states, 3370 states have (on average 1.175074183976261) internal successors, (3960), 3403 states have internal predecessors, (3960), 421 states have call successors, (421), 346 states have call predecessors, (421), 450 states have return successors, (674), 492 states have call predecessors, (674), 420 states have call successors, (674) [2021-12-22 11:43:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 5055 transitions. [2021-12-22 11:43:17,831 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 5055 transitions. Word has length 146 [2021-12-22 11:43:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:17,831 INFO L470 AbstractCegarLoop]: Abstraction has 4242 states and 5055 transitions. [2021-12-22 11:43:17,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-22 11:43:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 5055 transitions. [2021-12-22 11:43:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-22 11:43:17,837 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:17,838 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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] [2021-12-22 11:43:17,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 11:43:17,838 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 83168210, now seen corresponding path program 1 times [2021-12-22 11:43:17,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:17,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054014174] [2021-12-22 11:43:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:17,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 11:43:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-22 11:43:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 11:43:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 11:43:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-22 11:43:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-22 11:43:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-22 11:43:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-22 11:43:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-22 11:43:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 11:43:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-22 11:43:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-22 11:43:17,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:17,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054014174] [2021-12-22 11:43:17,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054014174] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:43:17,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566746938] [2021-12-22 11:43:17,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:17,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:17,919 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) [2021-12-22 11:43:17,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 11:43:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:17,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 11:43:17,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:43:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-22 11:43:18,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 11:43:18,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566746938] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:18,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 11:43:18,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 11:43:18,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836006437] [2021-12-22 11:43:18,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:18,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 11:43:18,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:18,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 11:43:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:18,270 INFO L87 Difference]: Start difference. First operand 4242 states and 5055 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-22 11:43:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:18,405 INFO L93 Difference]: Finished difference Result 6078 states and 7215 transitions. [2021-12-22 11:43:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 11:43:18,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2021-12-22 11:43:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:18,411 INFO L225 Difference]: With dead ends: 6078 [2021-12-22 11:43:18,412 INFO L226 Difference]: Without dead ends: 2113 [2021-12-22 11:43:18,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 11:43:18,417 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 237 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 [2021-12-22 11:43:18,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 11:43:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2021-12-22 11:43:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2021-12-22 11:43:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1690 states have (on average 1.16094674556213) internal successors, (1962), 1707 states have internal predecessors, (1962), 202 states have call successors, (202), 168 states have call predecessors, (202), 220 states have return successors, (303), 237 states have call predecessors, (303), 201 states have call successors, (303) [2021-12-22 11:43:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2467 transitions. [2021-12-22 11:43:18,512 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2467 transitions. Word has length 157 [2021-12-22 11:43:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:18,512 INFO L470 AbstractCegarLoop]: Abstraction has 2113 states and 2467 transitions. [2021-12-22 11:43:18,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-22 11:43:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2467 transitions. [2021-12-22 11:43:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-22 11:43:18,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:18,516 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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] [2021-12-22 11:43:18,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 11:43:18,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:18,733 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 702759848, now seen corresponding path program 1 times [2021-12-22 11:43:18,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:18,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115172049] [2021-12-22 11:43:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:18,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-22 11:43:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 11:43:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-22 11:43:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-22 11:43:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 11:43:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 11:43:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-22 11:43:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-22 11:43:18,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:18,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115172049] [2021-12-22 11:43:18,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115172049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:18,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:43:18,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 11:43:18,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097858867] [2021-12-22 11:43:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:18,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 11:43:18,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:18,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 11:43:18,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 11:43:18,814 INFO L87 Difference]: Start difference. First operand 2113 states and 2467 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-22 11:43:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:19,063 INFO L93 Difference]: Finished difference Result 3977 states and 4677 transitions. [2021-12-22 11:43:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 11:43:19,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2021-12-22 11:43:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:19,068 INFO L225 Difference]: With dead ends: 3977 [2021-12-22 11:43:19,068 INFO L226 Difference]: Without dead ends: 2216 [2021-12-22 11:43:19,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-22 11:43:19,071 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 187 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:19,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 418 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:43:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2021-12-22 11:43:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1672. [2021-12-22 11:43:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1341 states have (on average 1.1670395227442207) internal successors, (1565), 1357 states have internal predecessors, (1565), 158 states have call successors, (158), 132 states have call predecessors, (158), 172 states have return successors, (235), 182 states have call predecessors, (235), 157 states have call successors, (235) [2021-12-22 11:43:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2021-12-22 11:43:19,151 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 158 [2021-12-22 11:43:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:19,151 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2021-12-22 11:43:19,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-22 11:43:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2021-12-22 11:43:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-22 11:43:19,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:19,154 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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] [2021-12-22 11:43:19,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 11:43:19,155 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:19,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:19,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1973905068, now seen corresponding path program 1 times [2021-12-22 11:43:19,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:19,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141964456] [2021-12-22 11:43:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:19,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-22 11:43:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 11:43:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-22 11:43:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-22 11:43:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-22 11:43:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-22 11:43:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 11:43:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-22 11:43:19,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:19,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141964456] [2021-12-22 11:43:19,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141964456] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:43:19,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571355556] [2021-12-22 11:43:19,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:19,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:19,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:19,253 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) [2021-12-22 11:43:19,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 11:43:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:19,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 11:43:19,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:43:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-22 11:43:19,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:43:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-12-22 11:43:19,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571355556] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:43:19,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:43:19,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-22 11:43:19,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864485829] [2021-12-22 11:43:19,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:43:19,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 11:43:19,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 11:43:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-22 11:43:19,964 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-22 11:43:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:20,596 INFO L93 Difference]: Finished difference Result 3707 states and 4436 transitions. [2021-12-22 11:43:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 11:43:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 161 [2021-12-22 11:43:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:20,602 INFO L225 Difference]: With dead ends: 3707 [2021-12-22 11:43:20,602 INFO L226 Difference]: Without dead ends: 1959 [2021-12-22 11:43:20,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2021-12-22 11:43:20,605 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 1013 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:20,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1020 Valid, 379 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 11:43:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2021-12-22 11:43:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1759. [2021-12-22 11:43:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1386 states have (on average 1.1392496392496392) internal successors, (1579), 1407 states have internal predecessors, (1579), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2021-12-22 11:43:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2045 transitions. [2021-12-22 11:43:20,685 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2045 transitions. Word has length 161 [2021-12-22 11:43:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:20,685 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2045 transitions. [2021-12-22 11:43:20,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-22 11:43:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2045 transitions. [2021-12-22 11:43:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-12-22 11:43:20,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:20,688 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1] [2021-12-22 11:43:20,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-22 11:43:20,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:20,904 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 11419214, now seen corresponding path program 1 times [2021-12-22 11:43:20,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:20,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745937904] [2021-12-22 11:43:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:20,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 11:43:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-22 11:43:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 11:43:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 11:43:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 11:43:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-22 11:43:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-22 11:43:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:43:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-22 11:43:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-22 11:43:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-22 11:43:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-22 11:43:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-22 11:43:20,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:20,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745937904] [2021-12-22 11:43:20,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745937904] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:43:20,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228660580] [2021-12-22 11:43:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:20,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:20,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:20,968 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:43:20,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 11:43:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 11:43:21,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:43:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-12-22 11:43:21,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 11:43:21,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228660580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:43:21,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 11:43:21,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-22 11:43:21,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482459175] [2021-12-22 11:43:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:43:21,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 11:43:21,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 11:43:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 11:43:21,285 INFO L87 Difference]: Start difference. First operand 1759 states and 2045 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-22 11:43:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:21,499 INFO L93 Difference]: Finished difference Result 3404 states and 3968 transitions. [2021-12-22 11:43:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 11:43:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 178 [2021-12-22 11:43:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:21,505 INFO L225 Difference]: With dead ends: 3404 [2021-12-22 11:43:21,505 INFO L226 Difference]: Without dead ends: 1476 [2021-12-22 11:43:21,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-22 11:43:21,509 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:21,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 273 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:43:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-12-22 11:43:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1439. [2021-12-22 11:43:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1142 states have (on average 1.1287215411558669) internal successors, (1289), 1154 states have internal predecessors, (1289), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2021-12-22 11:43:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1648 transitions. [2021-12-22 11:43:21,603 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1648 transitions. Word has length 178 [2021-12-22 11:43:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:21,603 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 1648 transitions. [2021-12-22 11:43:21,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-22 11:43:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1648 transitions. [2021-12-22 11:43:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-12-22 11:43:21,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:43:21,608 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:21,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 11:43:21,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:21,828 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:43:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:43:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1242735248, now seen corresponding path program 1 times [2021-12-22 11:43:21,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:43:21,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330425609] [2021-12-22 11:43:21,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:21,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:43:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:43:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 11:43:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 11:43:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-22 11:43:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 11:43:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-22 11:43:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-22 11:43:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-22 11:43:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-22 11:43:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 11:43:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-22 11:43:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-22 11:43:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-22 11:43:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-22 11:43:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-22 11:43:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-22 11:43:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 11:43:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:43:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-22 11:43:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-12-22 11:43:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-22 11:43:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-12-22 11:43:21,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:43:21,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330425609] [2021-12-22 11:43:21,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330425609] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:43:21,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730981283] [2021-12-22 11:43:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:43:21,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:43:21,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:43:21,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 11:43:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:43:22,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 11:43:22,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:43:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-22 11:43:22,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:43:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-12-22 11:43:22,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730981283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:43:22,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:43:22,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-22 11:43:22,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864050295] [2021-12-22 11:43:22,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:43:22,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 11:43:22,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:43:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 11:43:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-22 11:43:22,828 INFO L87 Difference]: Start difference. First operand 1439 states and 1648 transitions. Second operand has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-22 11:43:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:43:23,236 INFO L93 Difference]: Finished difference Result 1742 states and 1983 transitions. [2021-12-22 11:43:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 11:43:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 252 [2021-12-22 11:43:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:43:23,237 INFO L225 Difference]: With dead ends: 1742 [2021-12-22 11:43:23,237 INFO L226 Difference]: Without dead ends: 0 [2021-12-22 11:43:23,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 546 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-12-22 11:43:23,240 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 270 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:43:23,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 454 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:43:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-22 11:43:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-22 11:43:23,240 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) [2021-12-22 11:43:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-22 11:43:23,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2021-12-22 11:43:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:43:23,241 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 11:43:23,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-22 11:43:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-22 11:43:23,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-22 11:43:23,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 11:43:23,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 11:43:23,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:43:23,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-22 11:43:41,802 INFO L858 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2021-12-22 11:43:41,802 INFO L858 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2021-12-22 11:43:41,802 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2021-12-22 11:43:41,803 INFO L854 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= ~p_num_write~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse18 (not (<= 2 ~q_write_ev~0))) (.cse19 (not (<= 1 ~c_dr_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse8 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse13 .cse14 .cse7 .cse15 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse13 .cse18 .cse19 .cse6 .cse14 .cse7 .cse15 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse11 .cse2 .cse12 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse6 .cse14 (not .cse0) .cse8 .cse9 .cse15 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse18 .cse19 .cse6 .cse14 .cse7 .cse8 .cse15 .cse10)))) [2021-12-22 11:43:41,803 INFO L854 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse2 (= ~p_dw_st~0 0)) (.cse29 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse28 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0))) (let ((.cse1 (not (= ~c_dr_st~0 0))) (.cse18 (and .cse29 .cse26 .cse28 .cse27)) (.cse4 (and .cse29 .cse28)) (.cse10 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse11 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse14 (not (<= 1 ~c_dr_pc~0))) (.cse22 (and .cse26 .cse27)) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse19 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse15 (not (= ~q_free~0 1))) (.cse16 (not (<= ~q_req_up~0 0))) (.cse20 (not (= ~q_read_ev~0 2))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse25 (not .cse2)) (.cse3 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~q_free~0 0))) (.cse21 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (and (= ~q_read_ev~0 1) .cse1 .cse2) .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9) (or .cse18 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse12 .cse19 (= ~q_write_ev~0 0) .cse7 .cse8 .cse16 .cse20 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse12 .cse21 .cse13 .cse14 .cse7 .cse15 .cse8 .cse20 .cse17 .cse22 .cse9) (or .cse3 .cse4 .cse23 .cse5 .cse24 .cse19 .cse21 .cse15 .cse8 .cse17 .cse9) (or .cse18 .cse3 .cse5 .cse6 .cse12 .cse19 .cse13 .cse7 .cse8 .cse16 .cse20 .cse9) (or .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse21 .cse13 .cse14 .cse7 .cse15 .cse8 .cse17 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse8 .cse16 .cse20 .cse17 .cse22 .cse9) (or .cse3 .cse23 .cse5 .cse24 .cse19 .cse21 .cse15 .cse8 .cse20 .cse17 .cse22 .cse9) (or (and .cse25 .cse26 .cse27) .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9) (or .cse0 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse23 .cse5 .cse24 (and .cse26 .cse28 .cse2 .cse27) .cse19 .cse7 .cse15 (not .cse3) .cse16 .cse20 .cse17 .cse9) (or .cse0 .cse25 .cse3 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9)))) [2021-12-22 11:43:41,803 INFO L858 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2021-12-22 11:43:41,803 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 307 331) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= ~p_num_write~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse18 (not (<= 2 ~q_write_ev~0))) (.cse19 (not (<= 1 ~c_dr_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse8 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse13 .cse14 .cse7 .cse15 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse13 .cse18 .cse19 .cse6 .cse14 .cse7 .cse15 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse11 .cse2 .cse12 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse6 .cse14 (not .cse0) .cse8 .cse9 .cse15 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse18 .cse19 .cse6 .cse14 .cse7 .cse8 .cse15 .cse10)))) [2021-12-22 11:43:41,803 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2021-12-22 11:43:41,803 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2021-12-22 11:43:41,803 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-12-22 11:43:41,803 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2021-12-22 11:43:41,804 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 251 270) the Hoare annotation is: true [2021-12-22 11:43:41,804 INFO L854 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse9 (= ~q_read_ev~0 2)) (.cse11 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse12 (not .cse5)) (.cse20 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not .cse11)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= ~q_free~0 0))) (.cse13 (not (<= ~c_dr_pc~0 1))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse18 (not .cse9)) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~q_req_up~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse8 .cse9) (not (<= ~p_num_write~0 1)) .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse2 .cse4 .cse7 .cse10) (or .cse0 .cse11 .cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse13 .cse14 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse7 .cse16 .cse19 .cse10) (or .cse0 .cse11 .cse12 .cse20 .cse2 .cse3 .cse13 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse8 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse4 .cse13 .cse5 .cse14 .cse6 .cse15 .cse7 .cse17 .cse18 .cse10)))) [2021-12-22 11:43:41,804 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2021-12-22 11:43:41,804 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 251 270) no Hoare annotation was computed. [2021-12-22 11:43:41,804 INFO L854 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse26 (<= 1 ~c_dr_pc~0)) (.cse27 (<= ~c_dr_pc~0 1)) (.cse22 (= 1 ~c_dr_i~0)) (.cse23 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse25 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse24 (<= 0 is_do_read_c_triggered_~__retres1~1))) (let ((.cse5 (and .cse26 .cse27 .cse22 .cse23 .cse25 .cse24)) (.cse14 (not (= ~q_free~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not .cse27)) (.cse21 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse8 (not .cse26)) (.cse18 (not (<= ~c_dr_pc~0 0))) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (not (= ~p_num_write~0 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse6 (not .cse25)) (.cse16 (and .cse23 .cse24)) (.cse9 (not (= ~p_dw_i~0 1))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (<= ~q_req_up~0 0))) (.cse17 (not (= ~q_read_ev~0 2))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not .cse22))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse14 .cse4 .cse15 .cse6 (= ~q_write_ev~0 0) .cse16 .cse9 .cse11 .cse17 .cse13) (or .cse0 .cse2 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse9 .cse11 .cse17 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse18 .cse2 .cse14 .cse16 .cse9 .cse13) (or .cse0 .cse19 .cse2 .cse20 .cse15 .cse6 .cse21 .cse16 .cse10 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse21 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse18 (not .cse15) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse19 .cse2 .cse20 .cse6 .cse16 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13)))) [2021-12-22 11:43:41,804 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 80 98) the Hoare annotation is: true [2021-12-22 11:43:41,804 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-12-22 11:43:41,804 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2021-12-22 11:43:41,804 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2021-12-22 11:43:41,804 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 80 98) no Hoare annotation was computed. [2021-12-22 11:43:41,804 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 271 288) the Hoare annotation is: (let ((.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse18 (not (= ~q_free~0 0))) (.cse17 (not (<= ~c_dr_pc~0 0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (and .cse22 (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (and .cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (not (<= ~c_dr_pc~0 1))) (.cse6 (= ~p_dw_st~0 0)) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse20 (not (<= ~q_req_up~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse4 .cse15 .cse6 .cse16 .cse7 .cse11 .cse12 .cse13) (or .cse0 .cse17 .cse2 .cse4 .cse18 .cse6 .cse10 .cse13) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse19 .cse10 .cse20 .cse13) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse16 .cse8 .cse19 .cse10 .cse20 .cse21 .cse13) (or .cse17 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse2 .cse15 .cse16 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13)))) [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L854 garLoopResultBuilder]: At program point update_channelsENTRY(lines 218 232) the Hoare annotation is: (let ((.cse18 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse9 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse10 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse30 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse11 (= ~q_read_ev~0 2))) (let ((.cse1 (not (= |old(~q_req_up~0)| 1))) (.cse8 (= ~q_req_up~0 1)) (.cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse3 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse26 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse6 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse23 (and .cse9 .cse10 .cse30 .cse11)) (.cse27 (not (= ~p_num_write~0 0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse24 (not (<= |old(~q_req_up~0)| 0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse25 (and .cse9 .cse10 .cse18 .cse30)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~q_free~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse1 .cse17 (and .cse8 .cse9 .cse10 .cse18) .cse4 .cse19 .cse6 .cse7 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse12 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse16) (or .cse0 .cse25 .cse17 .cse4 .cse19 .cse6 .cse7 .cse26 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse23 .cse4 .cse5 .cse6 .cse24 .cse7 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse25 .cse27 .cse4 .cse28 .cse7 .cse12 .cse26 .cse21 .cse22 .cse16) (or .cse0 .cse25 .cse17 .cse4 .cse19 .cse6 .cse24 .cse7 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse29 (not .cse7) .cse23 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse27 .cse4 .cse28 .cse24 .cse12 .cse14 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse29 .cse25 .cse4 .cse5 .cse7 .cse15 .cse16)))) [2021-12-22 11:43:41,805 INFO L854 garLoopResultBuilder]: At program point L48(lines 31 50) the Hoare annotation is: (let ((.cse16 (not (= |old(~q_req_up~0)| 1))) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (<= ~q_req_up~0 0)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse17 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse18 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= ~q_free~0 0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= |old(~q_req_up~0)| 0))) (.cse6 (= ~p_dw_st~0 0)) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (and .cse15 (= ~q_read_ev~0 2)) .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse14 .cse7 .cse20 .cse8 .cse9 .cse12) (or .cse0 .cse21 .cse2 .cse19 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse9 .cse12) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse16 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (and .cse15 .cse5) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse17 .cse18 .cse2 .cse19 .cse4 .cse13 .cse6 .cse14 .cse20 .cse8 .cse9 (= |old(~q_write_ev~0)| 0) .cse12) (or .cse21 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_num_write~0 0)) .cse2 (not (= ~c_num_read~0 0)) .cse13 .cse14 .cse20 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse19 .cse4 .cse13 .cse6 .cse14 .cse7 .cse20 .cse8 .cse9 .cse12))) [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L858 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2021-12-22 11:43:41,805 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 289 306) the Hoare annotation is: (let ((.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse22 (not (<= ~c_dr_pc~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (and .cse25 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse11 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse24 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse18 (not (= ~q_free~0 0))) (.cse5 (not (<= ~c_dr_pc~0 1))) (.cse6 (= ~p_dw_st~0 0)) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse20 (not (< 0 |old(~q_write_ev~0)|))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse21 (and .cse25 (= ~q_read_ev~0 2))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse4 .cse15 .cse6 .cse16 .cse7 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 (not (= |old(~q_read_ev~0)| 1)) .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse16 .cse19 .cse20 .cse10 .cse17 .cse21 .cse13) (or .cse22 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse2 .cse15 .cse16 .cse19 .cse10 .cse11 .cse17 .cse12 .cse21 .cse13) (or .cse0 .cse22 .cse2 .cse4 .cse18 .cse10 .cse13) (or .cse0 .cse23 .cse24 .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse19 .cse10 (= |old(~q_write_ev~0)| 0) .cse17 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13) (or .cse23 .cse24 .cse2 .cse18 .cse5 .cse6 .cse16 .cse19 .cse20 .cse9 .cse10 .cse17 .cse21 .cse13)))) [2021-12-22 11:43:41,805 INFO L854 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse2 (= ~q_free~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (< ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= 1 ~c_dr_pc~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (< 0 ~q_write_ev~0)) (.cse11 (<= ~q_req_up~0 0)) (.cse12 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse9 .cse3 .cse4 .cse17 .cse13 .cse6 .cse7 .cse18) (and .cse1 .cse3 .cse4 .cse10 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse9 .cse3 .cse4 .cse5 .cse17 .cse11 .cse13 .cse6 .cse18) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse10 .cse5 .cse19 .cse11 .cse12 .cse13) (and .cse1 .cse15 .cse2 (= ~q_read_ev~0 1) .cse16 .cse9 .cse3 .cse4 .cse5 .cse17 .cse11 .cse13 .cse6 .cse18) (and .cse0 .cse1 .cse8 .cse15 .cse9 .cse4 .cse10 .cse5 .cse19 .cse11 .cse12 .cse13 .cse14))) [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L474(lines 465 476) the Hoare annotation is: (= 1 ~c_dr_i~0) [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: (= 1 ~c_dr_i~0) [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse0 (= ~p_dw_st~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~q_req_up~0 1) (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse9 .cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~q_req_up~0 0) .cse0 (= ~q_read_ev~0 2) .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))))) [2021-12-22 11:43:41,806 INFO L854 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L854 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= ~q_req_up~0 1)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 (<= 1 ~q_read_ev~0) .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse15 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse16 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse13 (<= ~c_dr_pc~0 0)) (and .cse8 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13))) [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L854 garLoopResultBuilder]: At program point L419-1(lines 416 441) the Hoare annotation is: (let ((.cse17 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse19 (<= ~c_dr_pc~0 0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse10 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (not .cse17)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse12 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse21 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse15 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14 .cse15 .cse8 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse14 .cse17 .cse18 .cse15 .cse8 .cse19) (and .cse1 .cse3 (not (= ~q_write_ev~0 0)) .cse20 .cse12 .cse5 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15 .cse22) (and .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse15 .cse8 .cse9 .cse16) (and .cse3 .cse5 .cse6 .cse21 .cse15 .cse19) (and .cse1 .cse3 .cse20 .cse10 .cse11 .cse12 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15 .cse22) (and .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14 .cse18 .cse15 .cse8 .cse16) (and .cse1 .cse3 .cse11 .cse12 .cse5 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15)))) [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L854 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse4 (= ~q_free~0 1)) (.cse11 (<= ~q_req_up~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse15 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse12 (<= 1 ~q_read_ev~0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse10 .cse15 .cse5 .cse6 .cse7 .cse11 .cse16 .cse8) (and .cse17 .cse1 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse14 .cse10 .cse15 .cse5 .cse6 .cse13 .cse7 .cse16 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 (<= ~p_num_write~0 1) .cse12 .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L854 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L858 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2021-12-22 11:43:41,807 INFO L854 garLoopResultBuilder]: At program point L462(lines 448 464) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-22 11:43:41,807 INFO L854 garLoopResultBuilder]: At program point L173(lines 168 216) the Hoare annotation is: (and (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (< ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= 1 ~c_dr_i~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-12-22 11:43:41,808 INFO L858 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2021-12-22 11:43:41,808 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2021-12-22 11:43:41,808 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-22 11:43:41,808 INFO L854 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= ~q_req_up~0 1)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 (<= 1 ~q_read_ev~0) .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse15 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse16 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse13 (<= ~c_dr_pc~0 0)) (and .cse8 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13))) [2021-12-22 11:43:41,808 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2021-12-22 11:43:41,808 INFO L854 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse8 (<= ~c_dr_pc~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse3 .cse9 .cse5 (= ~q_free~0 0) .cse6 .cse7 .cse8) (and .cse1 .cse3 (<= 1 ~c_dr_pc~0) .cse4 (<= ~c_dr_pc~0 1) .cse9 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-12-22 11:43:41,823 INFO L854 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse12 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse0 (= ~p_num_write~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse18 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse13 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse13 .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse18 .cse8 .cse9 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse17 .cse8 .cse9 .cse12 .cse19) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse8 .cse9 .cse19) (and .cse11 .cse2 .cse23 .cse14 .cse15 .cse16 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse22 .cse8 .cse9 .cse19) (and .cse13 .cse11 .cse1 .cse2 .cse15 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse18 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse13 .cse11 .cse2 .cse23 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2021-12-22 11:43:41,823 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-12-22 11:43:41,826 INFO L854 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-22 11:43:41,826 INFO L854 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 (<= ~c_dr_pc~0 1) .cse4 .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 (= ~q_read_ev~0 2) .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse7 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2021-12-22 11:43:41,827 INFO L854 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2021-12-22 11:43:41,827 INFO L854 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse12 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse0 (= ~p_num_write~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse18 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse13 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse13 .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse18 .cse8 .cse9 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse17 .cse8 .cse9 .cse12 .cse19) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse8 .cse9 .cse19) (and .cse11 .cse2 .cse23 .cse14 .cse15 .cse16 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse22 .cse8 .cse9 .cse19) (and .cse13 .cse11 .cse1 .cse2 .cse15 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse18 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse13 .cse11 .cse2 .cse23 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2021-12-22 11:43:41,827 INFO L854 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2021-12-22 11:43:41,827 INFO L854 garLoopResultBuilder]: At program point L208-1(lines 168 216) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse2 (= ~c_num_read~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not .cse12)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse9 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse8 (<= 1 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_free~0 0) .cse7 (<= ~p_num_write~0 1) .cse8 .cse9 .cse10 (<= 1 ~p_num_write~0)) (and (= ~p_num_write~0 0) .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse9 .cse13 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and (let ((.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse3 .cse11 .cse4 (<= ~c_dr_pc~0 1) .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 .cse14 .cse9 .cse13 .cse15) (and .cse0 .cse1 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse14 .cse9 .cse13 .cse10 .cse15))) .cse8)))) [2021-12-22 11:43:41,828 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13))) [2021-12-22 11:43:41,828 INFO L854 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13))) [2021-12-22 11:43:41,828 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2021-12-22 11:43:41,828 INFO L858 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2021-12-22 11:43:41,828 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 61 79) no Hoare annotation was computed. [2021-12-22 11:43:41,828 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2021-12-22 11:43:41,828 INFO L854 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse18 (not (<= ~c_dr_pc~0 0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse1 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse9 (not (<= ~q_req_up~0 0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse16 .cse17 .cse11) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse5 .cse14 .cse8 .cse11) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse5 .cse8 .cse10 .cse11) (or .cse0 .cse19 .cse1 .cse2 .cse20 .cse5 .cse6 .cse14 .cse16 .cse17 .cse11) (or .cse18 (not .cse5) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse19 .cse1 .cse2 .cse20 .cse6 .cse8 .cse16 .cse9 .cse10 .cse17 .cse11) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_write_ev~0 0) .cse8 .cse9 .cse10 .cse11) (or .cse0 (= ~q_read_ev~0 1) .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse7 .cse15 .cse8 .cse16 .cse9 .cse17 .cse11))) [2021-12-22 11:43:41,828 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 61 79) the Hoare annotation is: true [2021-12-22 11:43:41,829 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2021-12-22 11:43:41,829 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2021-12-22 11:43:41,829 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-12-22 11:43:41,829 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2021-12-22 11:43:41,829 INFO L858 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2021-12-22 11:43:41,832 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:43:41,833 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 11:43:41,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:43:41 BoogieIcfgContainer [2021-12-22 11:43:41,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 11:43:41,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 11:43:41,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 11:43:41,875 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 11:43:41,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:43:02" (3/4) ... [2021-12-22 11:43:41,878 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-22 11:43:41,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-22 11:43:41,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-22 11:43:41,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-22 11:43:41,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-22 11:43:41,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-22 11:43:41,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-22 11:43:41,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-22 11:43:41,883 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2021-12-22 11:43:41,888 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-22 11:43:41,890 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-22 11:43:41,890 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-22 11:43:41,890 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-22 11:43:41,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) [2021-12-22 11:43:41,940 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 11:43:41,940 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 11:43:41,941 INFO L158 Benchmark]: Toolchain (without parser) took 40612.36ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 48.9MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2021-12-22 11:43:41,942 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:43:41,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.23ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.7MB in the beginning and 61.3MB in the end (delta: -12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 11:43:41,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.43ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 59.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 11:43:41,943 INFO L158 Benchmark]: Boogie Preprocessor took 34.32ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 57.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 11:43:41,943 INFO L158 Benchmark]: RCFGBuilder took 399.74ms. Allocated memory is still 86.0MB. Free memory was 57.7MB in the beginning and 63.9MB in the end (delta: -6.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2021-12-22 11:43:41,943 INFO L158 Benchmark]: TraceAbstraction took 39829.52ms. Allocated memory was 86.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 63.5MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-22 11:43:41,943 INFO L158 Benchmark]: Witness Printer took 65.60ms. Allocated memory is still 2.5GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 11:43:41,949 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.21ms. Allocated memory is still 71.3MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.23ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.7MB in the beginning and 61.3MB in the end (delta: -12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.43ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 59.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.32ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 57.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.74ms. Allocated memory is still 86.0MB. Free memory was 57.7MB in the beginning and 63.9MB in the end (delta: -6.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39829.52ms. Allocated memory was 86.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 63.5MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 65.60ms. Allocated memory is still 2.5GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 20]: 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 9 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.7s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9055 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8862 mSDsluCounter, 9911 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6570 mSDsCounter, 2652 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7525 IncrementalHoareTripleChecker+Invalid, 10177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2652 mSolverCounterUnsat, 3341 mSDtfsCounter, 7525 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2315 GetRequests, 1977 SyntacticMatches, 14 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13027occurred in iteration=13, InterpolantAutomatonStates: 288, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 8264 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 11931 PreInvPairs, 12450 NumberOfFragments, 9614 HoareAnnotationTreeSize, 11931 FomulaSimplifications, 1456 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 41 FomulaSimplificationsInter, 246945 FormulaSimplificationTreeSizeReductionInter, 14.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3134 NumberOfCodeBlocks, 3134 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3590 ConstructedInterpolants, 0 QuantifiedInterpolants, 7249 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3063 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 1916/1975 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: 168]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) || ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && c_num_read < p_num_write + 1)) && 1 <= q_read_ev) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || ((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0) || (((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1)) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(q_read_ev == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || (((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 == c_dr_i) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && ((((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || (((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 == c_dr_i) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((c_dr_st == 0 || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((c_dr_st == 0 || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(q_req_up == 1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(p_num_write <= 1)) || !(1 == c_dr_i)) && (((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc <= 1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) || ((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && c_num_read < p_num_write + 1) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) RESULT: Ultimate proved your program to be correct! [2021-12-22 11:43:41,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE