./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-16 01:06:15,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:06:15,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:06:15,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:06:15,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:06:15,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:06:15,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:06:15,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:06:15,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:06:15,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:06:15,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:06:15,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:06:15,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:06:15,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:06:15,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:06:15,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:06:15,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:06:15,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:06:15,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:06:15,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:06:15,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:06:15,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:06:15,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:06:15,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:06:15,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:06:15,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:06:15,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:06:15,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:06:15,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:06:15,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:06:15,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:06:15,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:06:15,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:06:15,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:06:15,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:06:15,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:06:15,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:06:15,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:06:15,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:06:15,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:06:15,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:06:15,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:06:15,856 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:06:15,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:06:15,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:06:15,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:06:15,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:06:15,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:06:15,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:06:15,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:06:15,858 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:06:15,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:06:15,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:06:15,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:06:15,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:06:15,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:06:15,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:06:15,860 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:06:15,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:06:15,860 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:06:15,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:06:15,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:06:15,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:06:15,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:06:15,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:15,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:06:15,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:06:15,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:06:15,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:06:15,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:06:15,862 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:06:15,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:06:15,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:06:15,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:06:15,863 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-16 01:06:16,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:06:16,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:06:16,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:06:16,026 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:06:16,027 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:06:16,030 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-16 01:06:16,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac2e8334/9bf9dfc663b44007bfceea21a87e72c5/FLAG07d5c2043 [2021-12-16 01:06:16,400 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:06:16,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-12-16 01:06:16,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac2e8334/9bf9dfc663b44007bfceea21a87e72c5/FLAG07d5c2043 [2021-12-16 01:06:16,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac2e8334/9bf9dfc663b44007bfceea21a87e72c5 [2021-12-16 01:06:16,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:06:16,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:06:16,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:16,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:06:16,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:06:16,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca08420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16, skipping insertion in model container [2021-12-16 01:06:16,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:06:16,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:06:16,635 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-16 01:06:16,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:16,701 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:06:16,711 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-16 01:06:16,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:06:16,754 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:06:16,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16 WrapperNode [2021-12-16 01:06:16,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:06:16,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:16,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:06:16,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:06:16,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,793 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2021-12-16 01:06:16,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:06:16,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:06:16,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:06:16,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:06:16,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:06:16,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:06:16,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:06:16,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:06:16,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (1/1) ... [2021-12-16 01:06:16,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:06:16,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:16,857 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-16 01:06:16,871 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-16 01:06:16,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-16 01:06:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-16 01:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-16 01:06:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-16 01:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-16 01:06:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-16 01:06:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-16 01:06:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-16 01:06:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-16 01:06:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-16 01:06:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-16 01:06:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-16 01:06:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:06:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-16 01:06:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-16 01:06:16,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:06:16,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:06:16,887 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-16 01:06:16,887 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-16 01:06:16,954 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:06:16,955 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:06:17,190 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:06:17,194 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:06:17,195 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 01:06:17,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:17 BoogieIcfgContainer [2021-12-16 01:06:17,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:06:17,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:06:17,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:06:17,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:06:17,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:06:16" (1/3) ... [2021-12-16 01:06:17,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4227b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:17, skipping insertion in model container [2021-12-16 01:06:17,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:06:16" (2/3) ... [2021-12-16 01:06:17,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4227b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:06:17, skipping insertion in model container [2021-12-16 01:06:17,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:17" (3/3) ... [2021-12-16 01:06:17,202 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-12-16 01:06:17,206 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:06:17,206 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:06:17,239 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:06:17,244 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-16 01:06:17,244 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:06:17,256 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-16 01:06:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:17,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:17,262 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-16 01:06:17,263 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:17,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2021-12-16 01:06:17,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:17,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361008979] [2021-12-16 01:06:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:17,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:17,487 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-16 01:06:17,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:17,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361008979] [2021-12-16 01:06:17,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361008979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:17,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:17,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:17,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155285268] [2021-12-16 01:06:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:17,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:17,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:17,512 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-16 01:06:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:17,819 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2021-12-16 01:06:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:06:17,821 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-16 01:06:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:17,829 INFO L225 Difference]: With dead ends: 215 [2021-12-16 01:06:17,829 INFO L226 Difference]: Without dead ends: 115 [2021-12-16 01:06:17,833 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-16 01:06:17,837 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 209 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:17,838 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.2s Time] [2021-12-16 01:06:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-16 01:06:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2021-12-16 01:06:17,893 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-16 01:06:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2021-12-16 01:06:17,900 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2021-12-16 01:06:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:17,901 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2021-12-16 01:06:17,902 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-16 01:06:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2021-12-16 01:06:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:17,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:17,906 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-16 01:06:17,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:06:17,907 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:17,909 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2021-12-16 01:06:17,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:17,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625829517] [2021-12-16 01:06:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:17,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,102 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-16 01:06:18,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:18,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625829517] [2021-12-16 01:06:18,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625829517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:18,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:18,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:06:18,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961178405] [2021-12-16 01:06:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:18,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:06:18,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:18,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:06:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:18,107 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-16 01:06:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:18,559 INFO L93 Difference]: Finished difference Result 320 states and 445 transitions. [2021-12-16 01:06:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 01:06:18,560 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-16 01:06:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:18,566 INFO L225 Difference]: With dead ends: 320 [2021-12-16 01:06:18,566 INFO L226 Difference]: Without dead ends: 232 [2021-12-16 01:06:18,571 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-16 01:06:18,572 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 399 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-16 01:06:18,573 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-16 01:06:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-16 01:06:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2021-12-16 01:06:18,610 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-16 01:06:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2021-12-16 01:06:18,613 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2021-12-16 01:06:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:18,614 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2021-12-16 01:06:18,614 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-16 01:06:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2021-12-16 01:06:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:18,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:18,620 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-16 01:06:18,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:06:18,621 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2021-12-16 01:06:18,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:18,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200386338] [2021-12-16 01:06:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:18,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:18,735 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-16 01:06:18,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200386338] [2021-12-16 01:06:18,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200386338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:18,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:18,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:06:18,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608020186] [2021-12-16 01:06:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:18,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:06:18,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:06:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:18,737 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-16 01:06:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:19,175 INFO L93 Difference]: Finished difference Result 540 states and 738 transitions. [2021-12-16 01:06:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 01:06:19,175 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-16 01:06:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:19,177 INFO L225 Difference]: With dead ends: 540 [2021-12-16 01:06:19,177 INFO L226 Difference]: Without dead ends: 363 [2021-12-16 01:06:19,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-16 01:06:19,179 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 446 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:19,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 691 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-16 01:06:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2021-12-16 01:06:19,194 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-16 01:06:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2021-12-16 01:06:19,196 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2021-12-16 01:06:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:19,196 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2021-12-16 01:06:19,196 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-16 01:06:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2021-12-16 01:06:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:19,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:19,198 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-16 01:06:19,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 01:06:19,198 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2021-12-16 01:06:19,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:19,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692941979] [2021-12-16 01:06:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:19,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,286 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-16 01:06:19,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:19,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692941979] [2021-12-16 01:06:19,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692941979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:19,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:19,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 01:06:19,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982888882] [2021-12-16 01:06:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:19,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 01:06:19,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 01:06:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:06:19,288 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-16 01:06:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:19,598 INFO L93 Difference]: Finished difference Result 590 states and 809 transitions. [2021-12-16 01:06:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 01:06:19,598 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-16 01:06:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:19,600 INFO L225 Difference]: With dead ends: 590 [2021-12-16 01:06:19,600 INFO L226 Difference]: Without dead ends: 323 [2021-12-16 01:06:19,601 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-16 01:06:19,601 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 114 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 01:06:19,602 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-16 01:06:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-16 01:06:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2021-12-16 01:06:19,620 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-16 01:06:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2021-12-16 01:06:19,622 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2021-12-16 01:06:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:19,622 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2021-12-16 01:06:19,622 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-16 01:06:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2021-12-16 01:06:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:19,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:19,624 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-16 01:06:19,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:06:19,624 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2021-12-16 01:06:19,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:19,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069219792] [2021-12-16 01:06:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:19,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:19,698 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-16 01:06:19,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:19,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069219792] [2021-12-16 01:06:19,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069219792] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:19,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:19,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 01:06:19,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982479531] [2021-12-16 01:06:19,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:19,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 01:06:19,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:19,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 01:06:19,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-16 01:06:19,700 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-16 01:06:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:20,776 INFO L93 Difference]: Finished difference Result 1616 states and 2193 transitions. [2021-12-16 01:06:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-16 01:06:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2021-12-16 01:06:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:20,781 INFO L225 Difference]: With dead ends: 1616 [2021-12-16 01:06:20,782 INFO L226 Difference]: Without dead ends: 1326 [2021-12-16 01:06:20,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-16 01:06:20,784 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 1339 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:20,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1353 Valid, 938 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 01:06:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-12-16 01:06:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1195. [2021-12-16 01:06:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 946 states have (on average 1.3266384778012685) internal successors, (1255), 967 states have internal predecessors, (1255), 124 states have call successors, (124), 105 states have call predecessors, (124), 124 states have return successors, (162), 124 states have call predecessors, (162), 122 states have call successors, (162) [2021-12-16 01:06:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1541 transitions. [2021-12-16 01:06:20,828 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1541 transitions. Word has length 64 [2021-12-16 01:06:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:20,829 INFO L470 AbstractCegarLoop]: Abstraction has 1195 states and 1541 transitions. [2021-12-16 01:06:20,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-16 01:06:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1541 transitions. [2021-12-16 01:06:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:20,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:20,830 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-16 01:06:20,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:06:20,831 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:20,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2021-12-16 01:06:20,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230877763] [2021-12-16 01:06:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:20,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:20,928 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-16 01:06:20,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230877763] [2021-12-16 01:06:20,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230877763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:20,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:20,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 01:06:20,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857782038] [2021-12-16 01:06:20,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:20,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 01:06:20,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 01:06:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:06:20,930 INFO L87 Difference]: Start difference. First operand 1195 states and 1541 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-16 01:06:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:21,269 INFO L93 Difference]: Finished difference Result 2486 states and 3214 transitions. [2021-12-16 01:06:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 01:06:21,270 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-16 01:06:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:21,276 INFO L225 Difference]: With dead ends: 2486 [2021-12-16 01:06:21,276 INFO L226 Difference]: Without dead ends: 1301 [2021-12-16 01:06:21,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-16 01:06:21,280 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 165 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:21,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 531 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2021-12-16 01:06:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1225. [2021-12-16 01:06:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 970 states have (on average 1.3103092783505155) internal successors, (1271), 991 states have internal predecessors, (1271), 124 states have call successors, (124), 105 states have call predecessors, (124), 130 states have return successors, (168), 130 states have call predecessors, (168), 122 states have call successors, (168) [2021-12-16 01:06:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1563 transitions. [2021-12-16 01:06:21,327 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1563 transitions. Word has length 64 [2021-12-16 01:06:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:21,327 INFO L470 AbstractCegarLoop]: Abstraction has 1225 states and 1563 transitions. [2021-12-16 01:06:21,328 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-16 01:06:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1563 transitions. [2021-12-16 01:06:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:21,328 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:21,329 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-16 01:06:21,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 01:06:21,329 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2021-12-16 01:06:21,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:21,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430437767] [2021-12-16 01:06:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:21,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,420 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-16 01:06:21,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:21,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430437767] [2021-12-16 01:06:21,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430437767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:21,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:21,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:06:21,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263302103] [2021-12-16 01:06:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:21,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:06:21,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:21,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:06:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:21,423 INFO L87 Difference]: Start difference. First operand 1225 states and 1563 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-16 01:06:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:21,893 INFO L93 Difference]: Finished difference Result 2480 states and 3110 transitions. [2021-12-16 01:06:21,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 01:06:21,894 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-16 01:06:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:21,898 INFO L225 Difference]: With dead ends: 2480 [2021-12-16 01:06:21,898 INFO L226 Difference]: Without dead ends: 1488 [2021-12-16 01:06:21,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-16 01:06:21,901 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 327 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:21,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 510 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2021-12-16 01:06:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1167. [2021-12-16 01:06:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 928 states have (on average 1.3038793103448276) internal successors, (1210), 944 states have internal predecessors, (1210), 118 states have call successors, (118), 100 states have call predecessors, (118), 120 states have return successors, (153), 123 states have call predecessors, (153), 116 states have call successors, (153) [2021-12-16 01:06:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1481 transitions. [2021-12-16 01:06:21,938 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1481 transitions. Word has length 64 [2021-12-16 01:06:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:21,938 INFO L470 AbstractCegarLoop]: Abstraction has 1167 states and 1481 transitions. [2021-12-16 01:06:21,939 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-16 01:06:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1481 transitions. [2021-12-16 01:06:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 01:06:21,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:21,939 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-16 01:06:21,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 01:06:21,940 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2021-12-16 01:06:21,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:21,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946268635] [2021-12-16 01:06:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:21,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:21,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,013 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-16 01:06:22,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:22,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946268635] [2021-12-16 01:06:22,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946268635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:22,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:22,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:06:22,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746835154] [2021-12-16 01:06:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:22,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:06:22,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:06:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:22,015 INFO L87 Difference]: Start difference. First operand 1167 states and 1481 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-16 01:06:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:22,327 INFO L93 Difference]: Finished difference Result 3506 states and 4441 transitions. [2021-12-16 01:06:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 01:06:22,327 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-16 01:06:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:22,335 INFO L225 Difference]: With dead ends: 3506 [2021-12-16 01:06:22,336 INFO L226 Difference]: Without dead ends: 2350 [2021-12-16 01:06:22,338 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-16 01:06:22,339 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 295 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 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-16 01:06:22,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 377 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2021-12-16 01:06:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2230. [2021-12-16 01:06:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 1748 states have (on average 1.2591533180778032) internal successors, (2201), 1781 states have internal predecessors, (2201), 237 states have call successors, (237), 199 states have call predecessors, (237), 244 states have return successors, (344), 251 states have call predecessors, (344), 235 states have call successors, (344) [2021-12-16 01:06:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2782 transitions. [2021-12-16 01:06:22,423 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2782 transitions. Word has length 64 [2021-12-16 01:06:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:22,423 INFO L470 AbstractCegarLoop]: Abstraction has 2230 states and 2782 transitions. [2021-12-16 01:06:22,423 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-16 01:06:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2782 transitions. [2021-12-16 01:06:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 01:06:22,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:22,424 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-16 01:06:22,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 01:06:22,425 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2021-12-16 01:06:22,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:22,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790027679] [2021-12-16 01:06:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:22,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,466 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-16 01:06:22,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:22,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790027679] [2021-12-16 01:06:22,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790027679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:22,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:22,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:22,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616634066] [2021-12-16 01:06:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:22,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:22,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:22,468 INFO L87 Difference]: Start difference. First operand 2230 states and 2782 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-16 01:06:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:22,745 INFO L93 Difference]: Finished difference Result 5546 states and 6927 transitions. [2021-12-16 01:06:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:06:22,746 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-16 01:06:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:22,756 INFO L225 Difference]: With dead ends: 5546 [2021-12-16 01:06:22,757 INFO L226 Difference]: Without dead ends: 3332 [2021-12-16 01:06:22,761 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-16 01:06:22,761 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 379 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:22,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 274 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2021-12-16 01:06:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3064. [2021-12-16 01:06:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 2396 states have (on average 1.2504173622704509) internal successors, (2996), 2434 states have internal predecessors, (2996), 329 states have call successors, (329), 279 states have call predecessors, (329), 338 states have return successors, (458), 352 states have call predecessors, (458), 327 states have call successors, (458) [2021-12-16 01:06:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3783 transitions. [2021-12-16 01:06:22,853 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3783 transitions. Word has length 65 [2021-12-16 01:06:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:22,853 INFO L470 AbstractCegarLoop]: Abstraction has 3064 states and 3783 transitions. [2021-12-16 01:06:22,853 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-16 01:06:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3783 transitions. [2021-12-16 01:06:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 01:06:22,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:22,854 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, 1, 1, 1, 1, 1, 1] [2021-12-16 01:06:22,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 01:06:22,855 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1232812656, now seen corresponding path program 1 times [2021-12-16 01:06:22,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:22,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176110926] [2021-12-16 01:06:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:22,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:22,911 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-16 01:06:22,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:22,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176110926] [2021-12-16 01:06:22,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176110926] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:22,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:22,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:22,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672128567] [2021-12-16 01:06:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:22,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:22,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:22,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:22,913 INFO L87 Difference]: Start difference. First operand 3064 states and 3783 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-16 01:06:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:23,184 INFO L93 Difference]: Finished difference Result 6936 states and 8557 transitions. [2021-12-16 01:06:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:06:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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 71 [2021-12-16 01:06:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:23,197 INFO L225 Difference]: With dead ends: 6936 [2021-12-16 01:06:23,197 INFO L226 Difference]: Without dead ends: 3886 [2021-12-16 01:06:23,203 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-16 01:06:23,204 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 266 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:23,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 377 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2021-12-16 01:06:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3618. [2021-12-16 01:06:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3618 states, 2836 states have (on average 1.2468265162200283) internal successors, (3536), 2878 states have internal predecessors, (3536), 385 states have call successors, (385), 329 states have call predecessors, (385), 396 states have return successors, (531), 412 states have call predecessors, (531), 383 states have call successors, (531) [2021-12-16 01:06:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4452 transitions. [2021-12-16 01:06:23,326 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4452 transitions. Word has length 71 [2021-12-16 01:06:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:23,326 INFO L470 AbstractCegarLoop]: Abstraction has 3618 states and 4452 transitions. [2021-12-16 01:06:23,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-16 01:06:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4452 transitions. [2021-12-16 01:06:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-16 01:06:23,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:23,328 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-16 01:06:23,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 01:06:23,328 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2021-12-16 01:06:23,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:23,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467056661] [2021-12-16 01:06:23,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:23,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,373 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-16 01:06:23,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:23,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467056661] [2021-12-16 01:06:23,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467056661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:23,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:23,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:06:23,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315486843] [2021-12-16 01:06:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:23,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:06:23,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:23,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:06:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:23,375 INFO L87 Difference]: Start difference. First operand 3618 states and 4452 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-16 01:06:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:23,729 INFO L93 Difference]: Finished difference Result 4704 states and 5747 transitions. [2021-12-16 01:06:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 01:06:23,730 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-16 01:06:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:23,745 INFO L225 Difference]: With dead ends: 4704 [2021-12-16 01:06:23,745 INFO L226 Difference]: Without dead ends: 4701 [2021-12-16 01:06:23,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-16 01:06:23,748 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 438 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:23,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 345 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4701 states. [2021-12-16 01:06:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4701 to 4080. [2021-12-16 01:06:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4080 states, 3191 states have (on average 1.2384832340958947) internal successors, (3952), 3236 states have internal predecessors, (3952), 435 states have call successors, (435), 373 states have call predecessors, (435), 453 states have return successors, (608), 472 states have call predecessors, (608), 434 states have call successors, (608) [2021-12-16 01:06:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 4995 transitions. [2021-12-16 01:06:23,920 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 4995 transitions. Word has length 72 [2021-12-16 01:06:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:23,921 INFO L470 AbstractCegarLoop]: Abstraction has 4080 states and 4995 transitions. [2021-12-16 01:06:23,921 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-16 01:06:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 4995 transitions. [2021-12-16 01:06:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-16 01:06:23,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:23,922 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-16 01:06:23,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 01:06:23,923 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:23,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1866244794, now seen corresponding path program 1 times [2021-12-16 01:06:23,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:23,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743630889] [2021-12-16 01:06:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:23,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:23,992 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-16 01:06:23,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:23,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743630889] [2021-12-16 01:06:23,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743630889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:23,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719669247] [2021-12-16 01:06:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:23,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:23,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:24,008 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-16 01:06:24,033 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-16 01:06:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:24,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 01:06:24,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:24,427 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-16 01:06:24,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:06:24,659 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-16 01:06:24,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719669247] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:06:24,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:06:24,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-16 01:06:24,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565689930] [2021-12-16 01:06:24,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:06:24,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 01:06:24,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:24,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 01:06:24,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-16 01:06:24,661 INFO L87 Difference]: Start difference. First operand 4080 states and 4995 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-16 01:06:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:25,702 INFO L93 Difference]: Finished difference Result 8398 states and 10204 transitions. [2021-12-16 01:06:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-16 01:06:25,702 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-16 01:06:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:25,727 INFO L225 Difference]: With dead ends: 8398 [2021-12-16 01:06:25,727 INFO L226 Difference]: Without dead ends: 8395 [2021-12-16 01:06:25,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2021-12-16 01:06:25,731 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 929 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:25,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [968 Valid, 864 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 01:06:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2021-12-16 01:06:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 7497. [2021-12-16 01:06:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7497 states, 5866 states have (on average 1.2333787930446642) internal successors, (7235), 5946 states have internal predecessors, (7235), 794 states have call successors, (794), 687 states have call predecessors, (794), 836 states have return successors, (1109), 865 states have call predecessors, (1109), 793 states have call successors, (1109) [2021-12-16 01:06:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7497 states to 7497 states and 9138 transitions. [2021-12-16 01:06:26,000 INFO L78 Accepts]: Start accepts. Automaton has 7497 states and 9138 transitions. Word has length 73 [2021-12-16 01:06:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:26,000 INFO L470 AbstractCegarLoop]: Abstraction has 7497 states and 9138 transitions. [2021-12-16 01:06:26,000 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-16 01:06:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 7497 states and 9138 transitions. [2021-12-16 01:06:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-16 01:06:26,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:26,001 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-16 01:06:26,033 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-16 01:06:26,215 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,SelfDestructingSolverStorable11 [2021-12-16 01:06:26,216 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1600677641, now seen corresponding path program 2 times [2021-12-16 01:06:26,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:26,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031898876] [2021-12-16 01:06:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:26,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,255 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-16 01:06:26,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:26,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031898876] [2021-12-16 01:06:26,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031898876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:26,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:26,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:26,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031191827] [2021-12-16 01:06:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:26,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:26,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:26,257 INFO L87 Difference]: Start difference. First operand 7497 states and 9138 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-16 01:06:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:26,617 INFO L93 Difference]: Finished difference Result 10091 states and 12347 transitions. [2021-12-16 01:06:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 01:06:26,618 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-16 01:06:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:26,630 INFO L225 Difference]: With dead ends: 10091 [2021-12-16 01:06:26,630 INFO L226 Difference]: Without dead ends: 3917 [2021-12-16 01:06:26,642 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-16 01:06:26,643 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 204 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:26,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 438 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2021-12-16 01:06:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 2909. [2021-12-16 01:06:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2284 states have (on average 1.2197898423817863) internal successors, (2786), 2310 states have internal predecessors, (2786), 313 states have call successors, (313), 269 states have call predecessors, (313), 311 states have return successors, (408), 331 states have call predecessors, (408), 312 states have call successors, (408) [2021-12-16 01:06:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 3507 transitions. [2021-12-16 01:06:26,759 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 3507 transitions. Word has length 76 [2021-12-16 01:06:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:26,759 INFO L470 AbstractCegarLoop]: Abstraction has 2909 states and 3507 transitions. [2021-12-16 01:06:26,760 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-16 01:06:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 3507 transitions. [2021-12-16 01:06:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 01:06:26,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:26,761 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-16 01:06:26,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 01:06:26,761 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1691663828, now seen corresponding path program 1 times [2021-12-16 01:06:26,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:26,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97956721] [2021-12-16 01:06:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:26,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-16 01:06:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:26,816 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-16 01:06:26,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:26,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97956721] [2021-12-16 01:06:26,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97956721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:26,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:26,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:06:26,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143301471] [2021-12-16 01:06:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:26,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:06:26,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:06:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:06:26,818 INFO L87 Difference]: Start difference. First operand 2909 states and 3507 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-16 01:06:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:27,408 INFO L93 Difference]: Finished difference Result 8685 states and 10490 transitions. [2021-12-16 01:06:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 01:06:27,408 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-16 01:06:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:27,422 INFO L225 Difference]: With dead ends: 8685 [2021-12-16 01:06:27,422 INFO L226 Difference]: Without dead ends: 4995 [2021-12-16 01:06:27,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-16 01:06:27,429 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 686 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:27,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 505 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2021-12-16 01:06:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4735. [2021-12-16 01:06:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 3675 states have (on average 1.196734693877551) internal successors, (4398), 3738 states have internal predecessors, (4398), 513 states have call successors, (513), 441 states have call predecessors, (513), 546 states have return successors, (758), 557 states have call predecessors, (758), 512 states have call successors, (758) [2021-12-16 01:06:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 5669 transitions. [2021-12-16 01:06:27,603 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 5669 transitions. Word has length 83 [2021-12-16 01:06:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:27,604 INFO L470 AbstractCegarLoop]: Abstraction has 4735 states and 5669 transitions. [2021-12-16 01:06:27,604 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-16 01:06:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 5669 transitions. [2021-12-16 01:06:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-16 01:06:27,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:27,605 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-16 01:06:27,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 01:06:27,606 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647019, now seen corresponding path program 1 times [2021-12-16 01:06:27,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:27,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036089853] [2021-12-16 01:06:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:27,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 01:06:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:27,677 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-16 01:06:27,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:27,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036089853] [2021-12-16 01:06:27,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036089853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:27,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:27,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 01:06:27,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330232312] [2021-12-16 01:06:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:27,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 01:06:27,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 01:06:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:06:27,680 INFO L87 Difference]: Start difference. First operand 4735 states and 5669 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-16 01:06:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:28,201 INFO L93 Difference]: Finished difference Result 8095 states and 9687 transitions. [2021-12-16 01:06:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 01:06:28,202 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-16 01:06:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:28,217 INFO L225 Difference]: With dead ends: 8095 [2021-12-16 01:06:28,217 INFO L226 Difference]: Without dead ends: 3896 [2021-12-16 01:06:28,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-16 01:06:28,227 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 839 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:28,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [853 Valid, 646 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2021-12-16 01:06:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3475. [2021-12-16 01:06:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 2681 states have (on average 1.1756807161506901) internal successors, (3152), 2732 states have internal predecessors, (3152), 378 states have call successors, (378), 323 states have call predecessors, (378), 415 states have return successors, (527), 421 states have call predecessors, (527), 377 states have call successors, (527) [2021-12-16 01:06:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 4057 transitions. [2021-12-16 01:06:28,353 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 4057 transitions. Word has length 92 [2021-12-16 01:06:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:28,354 INFO L470 AbstractCegarLoop]: Abstraction has 3475 states and 4057 transitions. [2021-12-16 01:06:28,354 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-16 01:06:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 4057 transitions. [2021-12-16 01:06:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-16 01:06:28,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:28,357 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-16 01:06:28,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 01:06:28,357 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash 578230399, now seen corresponding path program 1 times [2021-12-16 01:06:28,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:28,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498093994] [2021-12-16 01:06:28,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:28,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-16 01:06:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 01:06:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-16 01:06:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-16 01:06:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-16 01:06:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 01:06:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-16 01:06:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,450 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-16 01:06:28,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:28,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498093994] [2021-12-16 01:06:28,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498093994] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:28,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580837506] [2021-12-16 01:06:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:28,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:28,452 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-16 01:06:28,453 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-16 01:06:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:28,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 01:06:28,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:28,699 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-16 01:06:28,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:06:28,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580837506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:28,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:06:28,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-16 01:06:28,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370079082] [2021-12-16 01:06:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:28,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:28,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-16 01:06:28,701 INFO L87 Difference]: Start difference. First operand 3475 states and 4057 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-16 01:06:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:28,775 INFO L93 Difference]: Finished difference Result 5350 states and 6296 transitions. [2021-12-16 01:06:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:06:28,776 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-16 01:06:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:28,783 INFO L225 Difference]: With dead ends: 5350 [2021-12-16 01:06:28,783 INFO L226 Difference]: Without dead ends: 1891 [2021-12-16 01:06:28,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-16 01:06:28,788 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-16 01:06:28,788 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-16 01:06:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-12-16 01:06:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1769. [2021-12-16 01:06:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1421 states have (on average 1.1695988740323715) internal successors, (1662), 1435 states have internal predecessors, (1662), 167 states have call successors, (167), 137 states have call predecessors, (167), 180 states have return successors, (234), 196 states have call predecessors, (234), 166 states have call successors, (234) [2021-12-16 01:06:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2063 transitions. [2021-12-16 01:06:28,882 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2063 transitions. Word has length 144 [2021-12-16 01:06:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:28,882 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 2063 transitions. [2021-12-16 01:06:28,882 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-16 01:06:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2063 transitions. [2021-12-16 01:06:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-16 01:06:28,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:28,884 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-16 01:06:28,900 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-16 01:06:29,097 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,SelfDestructingSolverStorable15 [2021-12-16 01:06:29,097 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -371595989, now seen corresponding path program 1 times [2021-12-16 01:06:29,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:29,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201578015] [2021-12-16 01:06:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:29,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-16 01:06:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 01:06:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 01:06:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-16 01:06:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-16 01:06:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-16 01:06:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-16 01:06:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,150 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-16 01:06:29,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:29,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201578015] [2021-12-16 01:06:29,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201578015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:29,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:29,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:06:29,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511667121] [2021-12-16 01:06:29,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:29,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:06:29,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:29,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:06:29,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:06:29,152 INFO L87 Difference]: Start difference. First operand 1769 states and 2063 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-16 01:06:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:29,294 INFO L93 Difference]: Finished difference Result 1817 states and 2113 transitions. [2021-12-16 01:06:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:06:29,294 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-16 01:06:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:29,297 INFO L225 Difference]: With dead ends: 1817 [2021-12-16 01:06:29,297 INFO L226 Difference]: Without dead ends: 1443 [2021-12-16 01:06:29,298 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-16 01:06:29,299 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, 227 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-16 01:06:29,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 248 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:06:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2021-12-16 01:06:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1398. [2021-12-16 01:06:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1134 states have (on average 1.1781305114638447) internal successors, (1336), 1145 states have internal predecessors, (1336), 126 states have call successors, (126), 102 states have call predecessors, (126), 137 states have return successors, (179), 150 states have call predecessors, (179), 125 states have call successors, (179) [2021-12-16 01:06:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1641 transitions. [2021-12-16 01:06:29,351 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1641 transitions. Word has length 146 [2021-12-16 01:06:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:29,352 INFO L470 AbstractCegarLoop]: Abstraction has 1398 states and 1641 transitions. [2021-12-16 01:06:29,352 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-16 01:06:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1641 transitions. [2021-12-16 01:06:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-16 01:06:29,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:29,354 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-16 01:06:29,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 01:06:29,355 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash 702759848, now seen corresponding path program 1 times [2021-12-16 01:06:29,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:29,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887037607] [2021-12-16 01:06:29,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:29,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-16 01:06:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 01:06:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 01:06:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-16 01:06:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-16 01:06:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-16 01:06:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-16 01:06:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,425 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-16 01:06:29,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:29,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887037607] [2021-12-16 01:06:29,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887037607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:06:29,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:06:29,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:06:29,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138878594] [2021-12-16 01:06:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:06:29,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:06:29,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:29,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:06:29,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:06:29,427 INFO L87 Difference]: Start difference. First operand 1398 states and 1641 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-16 01:06:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:29,657 INFO L93 Difference]: Finished difference Result 2664 states and 3140 transitions. [2021-12-16 01:06:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 01:06:29,658 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-16 01:06:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:29,661 INFO L225 Difference]: With dead ends: 2664 [2021-12-16 01:06:29,661 INFO L226 Difference]: Without dead ends: 1371 [2021-12-16 01:06:29,663 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-16 01:06:29,663 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 191 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:29,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 423 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:06:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2021-12-16 01:06:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1287. [2021-12-16 01:06:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1047 states have (on average 1.183381088825215) internal successors, (1239), 1058 states have internal predecessors, (1239), 114 states have call successors, (114), 92 states have call predecessors, (114), 125 states have return successors, (161), 136 states have call predecessors, (161), 113 states have call successors, (161) [2021-12-16 01:06:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1514 transitions. [2021-12-16 01:06:29,707 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1514 transitions. Word has length 158 [2021-12-16 01:06:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:29,708 INFO L470 AbstractCegarLoop]: Abstraction has 1287 states and 1514 transitions. [2021-12-16 01:06:29,708 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-16 01:06:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1514 transitions. [2021-12-16 01:06:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 01:06:29,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:29,711 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-16 01:06:29,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 01:06:29,711 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1973905068, now seen corresponding path program 1 times [2021-12-16 01:06:29,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:29,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593753404] [2021-12-16 01:06:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:29,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-16 01:06:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 01:06:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-16 01:06:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-16 01:06:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:06:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-16 01:06:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-16 01:06:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,814 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-16 01:06:29,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:29,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593753404] [2021-12-16 01:06:29,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593753404] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:29,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531164980] [2021-12-16 01:06:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:29,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:29,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:29,816 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-16 01:06:29,874 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-16 01:06:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:29,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 01:06:29,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:30,202 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-16 01:06:30,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:06:30,586 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-16 01:06:30,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531164980] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:06:30,586 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:06:30,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-16 01:06:30,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537597841] [2021-12-16 01:06:30,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:06:30,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 01:06:30,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 01:06:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-16 01:06:30,588 INFO L87 Difference]: Start difference. First operand 1287 states and 1514 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-16 01:06:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:31,179 INFO L93 Difference]: Finished difference Result 3023 states and 3653 transitions. [2021-12-16 01:06:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 01:06:31,180 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-16 01:06:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:31,183 INFO L225 Difference]: With dead ends: 3023 [2021-12-16 01:06:31,183 INFO L226 Difference]: Without dead ends: 1678 [2021-12-16 01:06:31,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2021-12-16 01:06:31,186 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 792 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:31,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [799 Valid, 438 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:06:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2021-12-16 01:06:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1565. [2021-12-16 01:06:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1250 states have (on average 1.1536) internal successors, (1442), 1262 states have internal predecessors, (1442), 154 states have call successors, (154), 130 states have call predecessors, (154), 160 states have return successors, (230), 172 states have call predecessors, (230), 153 states have call successors, (230) [2021-12-16 01:06:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1826 transitions. [2021-12-16 01:06:31,235 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1826 transitions. Word has length 161 [2021-12-16 01:06:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:31,236 INFO L470 AbstractCegarLoop]: Abstraction has 1565 states and 1826 transitions. [2021-12-16 01:06:31,236 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-16 01:06:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1826 transitions. [2021-12-16 01:06:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-12-16 01:06:31,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:06:31,239 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-16 01:06:31,255 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-16 01:06:31,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:31,453 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:06:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:06:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1242735248, now seen corresponding path program 1 times [2021-12-16 01:06:31,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:06:31,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415685979] [2021-12-16 01:06:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:31,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:06:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:06:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:06:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 01:06:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:06:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 01:06:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-16 01:06:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 01:06:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-16 01:06:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-16 01:06:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 01:06:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 01:06:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-16 01:06:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-16 01:06:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-12-16 01:06:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-16 01:06:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-16 01:06:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:06:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 01:06:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-16 01:06:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-12-16 01:06:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-16 01:06:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,544 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-16 01:06:31,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:06:31,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415685979] [2021-12-16 01:06:31,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415685979] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:06:31,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965504393] [2021-12-16 01:06:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:06:31,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:06:31,546 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-16 01:06:31,547 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-16 01:06:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:06:31,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 01:06:31,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:06:31,989 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-16 01:06:31,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:06:32,444 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-16 01:06:32,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965504393] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:06:32,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:06:32,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-16 01:06:32,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607399502] [2021-12-16 01:06:32,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:06:32,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 01:06:32,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:06:32,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 01:06:32,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:06:32,448 INFO L87 Difference]: Start difference. First operand 1565 states and 1826 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-16 01:06:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:06:32,894 INFO L93 Difference]: Finished difference Result 1929 states and 2231 transitions. [2021-12-16 01:06:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 01:06:32,894 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-16 01:06:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:06:32,895 INFO L225 Difference]: With dead ends: 1929 [2021-12-16 01:06:32,895 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 01:06:32,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 549 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-12-16 01:06:32,898 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 350 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:06:32,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 521 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:06:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 01:06:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 01:06:32,899 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-16 01:06:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 01:06:32,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2021-12-16 01:06:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:06:32,899 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 01:06:32,900 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-16 01:06:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 01:06:32,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 01:06:32,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:06:32,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 01:06:33,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:06:33,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 01:06:45,817 INFO L858 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2021-12-16 01:06:45,817 INFO L858 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2021-12-16 01:06:45,817 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2021-12-16 01:06:45,819 INFO L854 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse15 (not (<= 2 ~q_write_ev~0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (= ~q_free~0 1))) (.cse3 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse8 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 0))) (.cse9 (not (= 0 ~q_req_up~0))) (.cse14 (= 0 |old(~p_dw_st~0)|)) (.cse10 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse17)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~c_dr_i~0 1))) (.cse4 (not (= 2 ~q_read_ev~0))) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse13 .cse9 .cse14 .cse15 .cse10 .cse11 (not (= ~c_dr_pc~0 1)) .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse5 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (= 1 ~c_dr_pc~0) .cse16 .cse10 .cse2 .cse11 .cse4 .cse5) (or .cse16 .cse9 .cse13 .cse14 .cse10 .cse15 .cse2 .cse11 .cse4 .cse5) (or .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 (and .cse17 (= ~p_dw_st~0 0)) .cse7 .cse8 .cse13 .cse9 (not (= |old(~p_dw_st~0)| 0)) .cse12) (or (= 0 ~q_write_ev~0) .cse13 .cse16 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse9 .cse14 .cse10 .cse11 .cse2 .cse4 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5)))) [2021-12-16 01:06:45,819 INFO L854 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse27 (= 0 ~q_req_up~0)) (.cse26 (= ~c_dr_pc~0 1)) (.cse8 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse23 (< 0 (+ activate_threads_~tmp~1 1))) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse25 (= ~c_dr_i~0 1)) (.cse28 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse24 (<= activate_threads_~tmp~1 0))) (let ((.cse1 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse13 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse0 (not (= ~q_free~0 1))) (.cse14 (and .cse8 .cse23 .cse9 .cse25 .cse28 .cse24)) (.cse15 (not (= ~p_num_write~0 0))) (.cse17 (not (= ~c_num_read~0 0))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not .cse28)) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse2 (not .cse26)) (.cse6 (not (= ~p_dw_i~0 1))) (.cse7 (not .cse27)) (.cse10 (= 0 |old(~p_dw_st~0)|)) (.cse22 (and .cse8 .cse23 .cse9 .cse25 .cse26 .cse27 .cse24)) (.cse21 (not (= ~q_free~0 0))) (.cse3 (not .cse25)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse16 (not (= 2 ~q_read_ev~0))) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0)))) (and (or .cse0 (and (not (= 0 ~c_dr_st~0)) (= ~q_read_ev~0 1) (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9) .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse14 .cse15 .cse3 .cse16 .cse5 .cse17 .cse18 .cse19 .cse6 .cse7 (not (= |old(~p_dw_st~0)| 0)) .cse20) (or .cse6 .cse1 (and (or .cse21 .cse7 .cse10 .cse2 .cse3 .cse11 .cse16 .cse5) (or .cse0 .cse7 .cse10 .cse11 .cse2 .cse3 .cse4 .cse16 .cse5 .cse12)) .cse22) (or .cse13 .cse0 .cse14 .cse3 .cse15 .cse16 .cse5 .cse17 .cse18 .cse19 .cse7 .cse11 .cse20) (or (= 0 ~q_write_ev~0) .cse2 .cse3 .cse16 .cse5 .cse6 .cse21 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse7 .cse10 .cse11 .cse22 (not (< ~c_num_read~0 ~p_num_write~0))) (or (= 1 ~c_dr_pc~0) .cse21 (and .cse8 .cse23 .cse9 .cse24) .cse3 .cse11 .cse16 .cse5)))) [2021-12-16 01:06:45,819 INFO L858 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2021-12-16 01:06:45,820 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 307 331) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse15 (not (<= 2 ~q_write_ev~0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (= ~q_free~0 1))) (.cse3 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse8 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 0))) (.cse9 (not (= 0 ~q_req_up~0))) (.cse14 (= 0 |old(~p_dw_st~0)|)) (.cse10 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse17)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~c_dr_i~0 1))) (.cse4 (not (= 2 ~q_read_ev~0))) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse13 .cse9 .cse14 .cse15 .cse10 .cse11 (not (= ~c_dr_pc~0 1)) .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse5 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (= 1 ~c_dr_pc~0) .cse16 .cse10 .cse2 .cse11 .cse4 .cse5) (or .cse16 .cse9 .cse13 .cse14 .cse10 .cse15 .cse2 .cse11 .cse4 .cse5) (or .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 (and .cse17 (= ~p_dw_st~0 0)) .cse7 .cse8 .cse13 .cse9 (not (= |old(~p_dw_st~0)| 0)) .cse12) (or (= 0 ~q_write_ev~0) .cse13 .cse16 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse9 .cse14 .cse10 .cse11 .cse2 .cse4 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5)))) [2021-12-16 01:06:45,820 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2021-12-16 01:06:45,820 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2021-12-16 01:06:45,820 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-12-16 01:06:45,820 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2021-12-16 01:06:45,820 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 251 270) the Hoare annotation is: true [2021-12-16 01:06:45,820 INFO L854 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse15 (= 0 ~c_dr_st~0))) (let ((.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse10 (= 0 ~p_dw_st~0)) (.cse11 (not .cse15)) (.cse12 (not (= ~q_free~0 0))) (.cse2 (not (= ~q_free~0 1))) (.cse1 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse14 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= ~c_dr_i~0 1))) (.cse4 (not (= 2 ~q_read_ev~0))) (.cse5 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= ~p_dw_st~0 0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (not (= 0 ~q_req_up~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~p_num_write~0 0)) .cse3 .cse4 .cse5 .cse6 (not (= ~c_last_read~0 ~p_last_write~0)) .cse7 (not (= ~c_dr_pc~0 ~q_req_up~0)) .cse8 .cse9 (not (= ~p_dw_pc~0 0))) (or .cse0 .cse1 (not (<= 1 ~p_num_write~0)) .cse3 .cse4 .cse5 (not (= ~q_req_up~0 1)) .cse10 .cse6 (= 1 ~c_dr_pc~0) .cse11 .cse12 .cse8 (not (<= ~p_num_write~0 1))) (or .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11 .cse8 .cse12 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse9 (not (< ~c_num_read~0 ~p_num_write~0))) (or .cse2 .cse1 .cse13 .cse14 .cse3 .cse15 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse4 .cse5 .cse7 .cse8 .cse9 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))))))) [2021-12-16 01:06:45,820 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2021-12-16 01:06:45,821 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 251 270) no Hoare annotation was computed. [2021-12-16 01:06:45,821 INFO L854 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse26 (= ~c_dr_pc~0 1)) (.cse22 (<= 0 is_do_read_c_triggered_~__retres1~1)) (.cse24 (= ~c_dr_i~0 1)) (.cse27 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse23 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse25 (= 0 ~q_req_up~0)) (.cse28 (= ~q_write_ev~0 ~q_read_ev~0))) (let ((.cse0 (not .cse28)) (.cse2 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (and .cse22 .cse28 .cse24 .cse27 .cse23 .cse25)) (.cse11 (not .cse27)) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse19 (and .cse22 .cse26 .cse24 .cse23 .cse25)) (.cse1 (not (= ~q_free~0 1))) (.cse16 (not (<= 2 ~q_write_ev~0))) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse17 (not .cse26)) (.cse18 (and .cse22 .cse24 .cse26 .cse23 .cse25)) (.cse13 (= 0 ~p_dw_st~0)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse10 (not .cse25)) (.cse15 (not (= ~q_free~0 0))) (.cse4 (not .cse24)) (.cse3 (= 0 ~c_dr_st~0)) (.cse5 (not (= 2 ~q_read_ev~0))) (.cse6 (not (= ~q_buf_0~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse15 .cse10 .cse16 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~p_dw_st~0 0)) .cse10 .cse11 .cse14 .cse12) (or .cse19 .cse1 .cse14 .cse10 .cse16 .cse3 .cse17 .cse4 .cse20 (not (= ~q_read_ev~0 1)) .cse6 .cse21) (or .cse19 .cse13 .cse1 .cse14 .cse10 .cse16 .cse17 .cse4 .cse3 .cse20 .cse6 .cse21) (or (= 0 ~q_write_ev~0) .cse17 .cse4 .cse3 .cse18 .cse5 .cse6 .cse13 (< 0 ~q_write_ev~0) .cse14 .cse15 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse10 (not (< ~c_num_read~0 ~p_num_write~0))) (or (= 1 ~c_dr_pc~0) .cse15 .cse4 .cse3 (and .cse22 .cse23) .cse5 .cse6)))) [2021-12-16 01:06:45,821 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 80 98) the Hoare annotation is: true [2021-12-16 01:06:45,821 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-12-16 01:06:45,822 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2021-12-16 01:06:45,822 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2021-12-16 01:06:45,822 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 80 98) no Hoare annotation was computed. [2021-12-16 01:06:45,822 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2021-12-16 01:06:45,822 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 271 288) the Hoare annotation is: (let ((.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse19 (= 2 ~q_read_ev~0))) (let ((.cse0 (= 0 ~p_dw_st~0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse6 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (and .cse7 .cse19)) (.cse12 (and (= ~q_write_ev~0 ~q_read_ev~0) .cse19)) (.cse1 (not (= ~q_free~0 1))) (.cse13 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|))) (.cse5 (not (= ~c_dr_i~0 1))) (.cse14 (not (= ~p_num_write~0 0))) (.cse4 (= 0 ~c_dr_st~0)) (.cse8 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse11 (not (= 2 |old(~q_read_ev~0)|))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse3 (not (= 0 ~q_req_up~0))) (.cse18 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~c_dr_pc~0 1)) .cse5 .cse6 (and .cse7 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or .cse0 .cse2 .cse9 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse10 .cse4 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse8 .cse11) (or .cse12 .cse1 .cse13 .cse14 .cse5 .cse8 .cse11 .cse15 .cse16 (not (= ~p_dw_st~0 0)) .cse17 .cse2 .cse3 .cse18) (or .cse0 .cse9 .cse3 .cse2 .cse10 .cse5 .cse4 .cse6 .cse8 .cse11) (or (= 1 ~c_dr_pc~0) .cse9 .cse10 .cse5 .cse4 .cse8 .cse11) (or .cse12 .cse1 .cse13 .cse5 .cse14 .cse4 .cse8 .cse11 .cse15 .cse16 .cse17 .cse3 .cse18)))) [2021-12-16 01:06:45,822 INFO L858 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2021-12-16 01:06:45,823 INFO L858 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2021-12-16 01:06:45,824 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2021-12-16 01:06:45,824 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2021-12-16 01:06:45,825 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2021-12-16 01:06:45,825 INFO L854 garLoopResultBuilder]: At program point update_channelsENTRY(lines 218 232) the Hoare annotation is: (let ((.cse23 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse27 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse22 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse28 (= 2 ~q_read_ev~0))) (let ((.cse1 (and .cse22 (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) .cse28)) (.cse3 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|))) (.cse4 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse0 (not (= ~c_dr_pc~0 |old(~q_req_up~0)|))) (.cse2 (not (= ~q_free~0 1))) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse24 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse10 (not (= 0 |old(~q_req_up~0)|))) (.cse16 (and .cse21 .cse22 .cse27 .cse28)) (.cse13 (= 0 ~p_dw_st~0)) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse5 (not (= ~c_dr_i~0 1))) (.cse17 (= 0 ~c_dr_st~0)) (.cse19 (not (<= 2 |old(~q_write_ev~0)|))) (.cse25 (not (= |old(~q_req_up~0)| 1))) (.cse26 (and .cse21 .cse22 .cse27 .cse23)) (.cse18 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse7 (not (= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~p_dw_st~0 0)) .cse11 .cse12) (or .cse13 .cse10 .cse11 .cse14 .cse15 (= 0 |old(~q_write_ev~0)|) .cse16 .cse17 .cse5 .cse18 .cse6 .cse7) (or .cse13 .cse10 .cse2 .cse11 .cse17 (not (= ~c_dr_pc~0 1)) .cse5 .cse19 .cse20 (and .cse21 .cse22 .cse23 (= 0 ~q_req_up~0)) .cse6 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse0 .cse2 .cse5 .cse17 (not (<= 1 |old(~q_read_ev~0)|)) .cse20 .cse6 .cse13 .cse9 .cse11 .cse19 .cse25 .cse26 .cse24) (or (= 1 ~c_dr_pc~0) .cse14 .cse16 .cse5 .cse17 .cse6 .cse7) (or .cse13 .cse10 .cse14 .cse11 .cse16 .cse5 .cse17 .cse19 .cse6 .cse7) (or .cse13 .cse14 .cse15 .cse11 .cse5 .cse17 .cse19 .cse25 .cse26 .cse18 .cse6 .cse7)))) [2021-12-16 01:06:45,825 INFO L854 garLoopResultBuilder]: At program point L48(lines 31 50) the Hoare annotation is: (let ((.cse21 (= 0 ~q_req_up~0))) (let ((.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse9 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse19 (= 1 ~c_dr_pc~0)) (.cse2 (not (= ~q_free~0 0))) (.cse5 (and .cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse0 (not (= ~c_dr_pc~0 |old(~q_req_up~0)|))) (.cse16 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|))) (.cse17 (not (= ~p_num_write~0 0))) (.cse11 (not (= 2 |old(~q_read_ev~0)|))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (= ~p_dw_pc~0 0))) (.cse1 (= 0 ~p_dw_st~0)) (.cse14 (not (= 0 |old(~q_req_up~0)|))) (.cse15 (not (= ~q_free~0 1))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse7 (= 0 ~c_dr_st~0)) (.cse6 (not (= ~c_dr_i~0 1))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse10 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse22 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse6 .cse17 .cse7 .cse10 .cse18 .cse11) (or .cse19 .cse14 .cse2 .cse6 .cse7 .cse10 .cse11) (or .cse0 .cse15 .cse6 .cse7 (not (<= 1 |old(~q_read_ev~0)|)) .cse20 .cse10 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse21) .cse1 .cse13 .cse4 .cse8 (not (= |old(~q_req_up~0)| 1)) .cse22) (or .cse1 .cse14 .cse4 .cse2 .cse3 (= 0 |old(~q_write_ev~0)|) .cse7 .cse6 .cse9 .cse10 .cse11) (or .cse1 .cse14 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11) (or .cse19 .cse2 .cse5 .cse6 .cse7 .cse10 .cse11) (or .cse0 .cse15 .cse16 .cse17 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~p_dw_st~0 0)) .cse4 .cse18) (or .cse1 .cse14 .cse15 .cse4 .cse7 (not (= ~c_dr_pc~0 1)) .cse6 .cse8 .cse20 .cse10 .cse22)))) [2021-12-16 01:06:45,825 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2021-12-16 01:06:45,825 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2021-12-16 01:06:45,825 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2021-12-16 01:06:45,825 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2021-12-16 01:06:45,826 INFO L858 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2021-12-16 01:06:45,826 INFO L858 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2021-12-16 01:06:45,826 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 289 306) the Hoare annotation is: (let ((.cse25 (= 2 ~q_read_ev~0)) (.cse26 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse14 (not (< 0 |old(~q_write_ev~0)|))) (.cse8 (and .cse26 (= ~q_read_ev~0 |old(~q_read_ev~0)|))) (.cse7 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse11 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse0 (= 0 ~p_dw_st~0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse16 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse17 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse12 (not (= ~q_free~0 0))) (.cse15 (and .cse26 .cse25)) (.cse18 (and (= ~q_write_ev~0 ~q_read_ev~0) .cse25)) (.cse1 (not (= ~q_free~0 1))) (.cse19 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|))) (.cse6 (not (= ~c_dr_i~0 1))) (.cse20 (not (= ~p_num_write~0 0))) (.cse4 (= 0 ~c_dr_st~0)) (.cse10 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse13 (not (= 2 |old(~q_read_ev~0)|))) (.cse21 (not (= ~c_num_read~0 0))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse3 (not (= 0 ~q_req_up~0))) (.cse24 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (and (or .cse0 .cse12 .cse3 .cse6 .cse4 .cse10 .cse13) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse13)) .cse14 .cse2 .cse15) (or .cse0 .cse14 .cse2 .cse12 .cse16 .cse3 .cse15 .cse5 .cse6 .cse17 .cse10 .cse13) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 (not (= |old(~q_read_ev~0)| 1))) (or .cse18 .cse1 .cse19 .cse20 .cse6 .cse10 .cse13 .cse21 .cse22 (not (= ~p_dw_st~0 0)) .cse23 .cse2 .cse3 .cse24) (or .cse15 (= 0 |old(~q_write_ev~0)|) .cse4 .cse5 .cse6 .cse10 .cse13 .cse0 .cse2 .cse12 .cse16 .cse3 .cse17) (or (= 1 ~c_dr_pc~0) .cse12 .cse15 .cse6 .cse4 .cse10 .cse13) (or .cse18 .cse1 .cse19 .cse6 .cse20 .cse4 .cse10 .cse13 .cse21 .cse22 .cse23 .cse3 .cse24)))) [2021-12-16 01:06:45,826 INFO L854 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~q_buf_0~0 ~p_last_write~0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) [2021-12-16 01:06:45,826 INFO L858 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2021-12-16 01:06:45,826 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~q_buf_0~0 ~p_last_write~0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) [2021-12-16 01:06:45,826 INFO L854 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (= ~q_free~0 0)) (.cse15 (< 0 ~q_write_ev~0)) (.cse7 (< ~c_num_read~0 ~p_num_write~0)) (.cse9 (= 2 ~q_read_ev~0)) (.cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= 2 ~q_write_ev~0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse13 (= ~q_free~0 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (= ~c_dr_i~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= 0 ~q_req_up~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ~q_write_ev~0))) (and .cse11 .cse12 .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse14 .cse8) (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse3 .cse13 .cse5 (= ~c_dr_pc~0 ~q_req_up~0) (= ~c_num_read~0 0) .cse9 .cse8 (= ~p_dw_pc~0 0)) (and .cse1 (not (= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse5 .cse9) (and .cse15 .cse4 (or (and .cse1 .cse0 .cse2 .cse3 .cse5 .cse9 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse14 .cse8 .cse9))) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse2 .cse3 .cse13 .cse4 (= ~q_read_ev~0 1) .cse5 .cse6 .cse14 .cse8))) [2021-12-16 01:06:45,827 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 01:06:45,827 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 01:06:45,827 INFO L854 garLoopResultBuilder]: At program point L474(lines 465 476) the Hoare annotation is: (= ~c_dr_i~0 1) [2021-12-16 01:06:45,827 INFO L858 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2021-12-16 01:06:45,827 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2021-12-16 01:06:45,827 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2021-12-16 01:06:45,827 INFO L854 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse13 (= ~q_free~0 1)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 2 ~q_write_ev~0)) (.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (= ~q_free~0 0)) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (= ~c_dr_i~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (< ~c_num_read~0 ~p_num_write~0)) (.cse8 (= 0 ~q_req_up~0)) (.cse9 (= 2 ~q_read_ev~0)) (.cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ~q_write_ev~0))) (and .cse11 .cse12 .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse12 .cse11 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse14 .cse9 .cse8) (and .cse12 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse8) (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse3 .cse13 .cse5 (= ~c_dr_pc~0 ~q_req_up~0) (= ~c_num_read~0 0) .cse9 .cse8 (= ~p_dw_pc~0 0)) (and .cse1 (not (= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse5 .cse9) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-12-16 01:06:45,827 INFO L858 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2021-12-16 01:06:45,828 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2021-12-16 01:06:45,828 INFO L854 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: (= ~c_dr_i~0 1) [2021-12-16 01:06:45,828 INFO L854 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse13 (= ~q_free~0 1)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse12 (<= 2 ~q_write_ev~0)) (.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (= ~q_free~0 0)) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (= ~c_dr_i~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (< ~c_num_read~0 ~p_num_write~0)) (.cse8 (= 0 ~q_req_up~0)) (.cse9 (= 2 ~q_read_ev~0)) (.cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ~q_write_ev~0))) (and .cse11 .cse12 .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse12 .cse11 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse14 .cse9 .cse8) (and .cse12 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse8) (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse3 .cse13 .cse5 (= ~c_dr_pc~0 ~q_req_up~0) (= ~c_num_read~0 0) .cse9 .cse8 (= ~p_dw_pc~0 0)) (and .cse1 (not (= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse5 .cse9) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-12-16 01:06:45,828 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2021-12-16 01:06:45,828 INFO L854 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2021-12-16 01:06:45,828 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2021-12-16 01:06:45,828 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2021-12-16 01:06:45,828 INFO L854 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse0 (= ~q_buf_0~0 ~p_last_write~0)) (.cse1 (= ~q_free~0 1)) (.cse2 (= ~p_dw_i~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse5 (not (= 0 ~c_dr_st~0))) (.cse6 (= ~c_dr_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 (= ~c_dr_pc~0 1) (= ~c_num_read~0 0) (= 2 ~q_read_ev~0)) (and (<= ~p_num_write~0 ~c_num_read~0) (not (= 0 ~p_dw_st~0)) .cse0 .cse1 .cse2 (< ~c_num_read~0 (+ ~p_num_write~0 1)) (= ~q_req_up~0 1) (<= 2 ~q_write_ev~0) .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 ~q_req_up~0) (<= 1 ~q_read_ev~0)))) [2021-12-16 01:06:45,829 INFO L854 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse13 (= ~q_free~0 1)) (.cse12 (<= 2 ~q_write_ev~0)) (.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (= ~q_free~0 0)) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (= ~c_dr_i~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (< ~c_num_read~0 ~p_num_write~0)) (.cse8 (= 0 ~q_req_up~0)) (.cse9 (= 2 ~q_read_ev~0)) (.cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ~q_write_ev~0))) (and .cse11 .cse12 .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse12 .cse11 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse14 .cse9 .cse8) (and .cse12 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse8) (and .cse1 (not (= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse5 .cse9) (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse3 .cse13 .cse5 (= ~c_dr_pc~0 ~q_req_up~0) (= ~c_num_read~0 0) .cse9 .cse8 (= ~p_dw_pc~0 0)) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-12-16 01:06:45,829 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2021-12-16 01:06:45,829 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2021-12-16 01:06:45,829 INFO L854 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse11 (= ~q_free~0 0)) (.cse8 (not (= 0 ~c_dr_st~0))) (.cse2 (= ~q_buf_0~0 ~p_last_write~0)) (.cse4 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_i~0 1)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse15 (= 0 ~q_req_up~0)) (.cse13 (= 2 ~q_read_ev~0)) (.cse14 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_req_up~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ~q_read_ev~0)) (and .cse6 .cse1 .cse11 .cse8 .cse2 .cse4 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 (= ~c_dr_pc~0 1) .cse5 .cse15) (and .cse6 .cse11 .cse1 .cse8 .cse2 .cse4 .cse9 .cse13 .cse15) (and .cse11 (not (= 1 ~c_dr_pc~0)) .cse8 .cse2 .cse9 .cse13) (and (= ~p_num_write~0 0) .cse7 (= ~q_write_ev~0 ~q_read_ev~0) .cse8 .cse2 .cse3 .cse9 .cse10 (= ~c_num_read~0 0) .cse13 .cse15 (= ~p_dw_pc~0 0)) (and .cse1 .cse11 .cse8 .cse2 .cse4 .cse9 .cse12 .cse15 .cse13 .cse14 (not (= 0 ~q_write_ev~0))))) [2021-12-16 01:06:45,829 INFO L858 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2021-12-16 01:06:45,829 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-12-16 01:06:45,829 INFO L854 garLoopResultBuilder]: At program point L419-1(lines 416 441) the Hoare annotation is: (let ((.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse15 (= ~p_num_write~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse13 (= ~q_free~0 1)) (.cse20 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse19 (= ~c_num_read~0 0)) (.cse16 (= ~p_dw_pc~0 0)) (.cse12 (<= 2 ~q_write_ev~0)) (.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (= ~q_free~0 0)) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (= ~c_dr_i~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (< ~c_num_read~0 ~p_num_write~0)) (.cse8 (= 0 ~q_req_up~0)) (.cse9 (= 2 ~q_read_ev~0)) (.cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ~q_write_ev~0))) (and .cse11 .cse12 .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse15 .cse3 .cse13 .cse4 (= ~p_dw_st~0 0) .cse8 .cse16 .cse17 .cse18 .cse5 .cse19 .cse20 .cse9) (and .cse12 .cse11 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse14 .cse9 .cse8) (and .cse12 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse8) (and .cse1 (not (= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse5 .cse9) (and .cse15 .cse17 .cse18 .cse2 .cse3 .cse13 .cse5 .cse20 .cse19 .cse9 .cse8 .cse16) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-12-16 01:06:45,830 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2021-12-16 01:06:45,830 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-12-16 01:06:45,830 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2021-12-16 01:06:45,830 INFO L854 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse11 (= ~p_num_write~0 0)) (.cse10 (= 0 ~q_req_up~0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse18 (not (= 1 ~c_dr_pc~0))) (.cse9 (= ~q_req_up~0 1)) (.cse1 (= ~q_free~0 0)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~c_num_read~0 0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse3 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse4 (not (= 0 ~c_dr_st~0))) (.cse5 (= ~q_buf_0~0 ~p_last_write~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse14 (= ~q_free~0 1)) (.cse7 (= ~c_dr_i~0 1)) (.cse8 (= 2 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< ~c_num_read~0 ~p_num_write~0) .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8) (and .cse11 .cse12 .cse13 .cse4 .cse5 .cse14 .cse7 .cse15 .cse16 .cse8 .cse10 .cse17) (and .cse1 .cse18 .cse4 .cse5 .cse7 .cse8) (and .cse11 .cse2 .cse5 .cse14 .cse6 .cse10 .cse17 .cse12 .cse3 .cse13 .cse7 .cse16 .cse15 .cse8) (and .cse2 .cse18 .cse5 .cse6 .cse9 (<= 1 ~p_num_write~0) (<= ~p_num_write~0 1) .cse1 .cse3 .cse13 .cse7 .cse16 .cse8) (and .cse0 (<= ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 (= ~c_dr_pc~0 1) (< ~c_num_read~0 (+ ~p_num_write~0 1)) .cse8))) [2021-12-16 01:06:45,830 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2021-12-16 01:06:45,830 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2021-12-16 01:06:45,830 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 01:06:45,830 INFO L854 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~q_buf_0~0 ~p_last_write~0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) [2021-12-16 01:06:45,831 INFO L858 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2021-12-16 01:06:45,831 INFO L858 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2021-12-16 01:06:45,831 INFO L854 garLoopResultBuilder]: At program point L462(lines 448 464) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~q_buf_0~0 ~p_last_write~0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) [2021-12-16 01:06:45,831 INFO L854 garLoopResultBuilder]: At program point L173(lines 168 216) the Hoare annotation is: (and (<= 2 ~q_write_ev~0) (= ~q_free~0 0) (not (= 0 ~p_dw_st~0)) (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) (not (= 0 ~c_dr_st~0)) (= ~q_buf_0~0 ~p_last_write~0) (= ~p_dw_i~0 1) (= ~c_dr_i~0 1) (= ~c_dr_pc~0 1) (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)) (<= 1 ~q_read_ev~0)) [2021-12-16 01:06:45,831 INFO L858 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2021-12-16 01:06:45,831 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2021-12-16 01:06:45,831 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 01:06:45,831 INFO L854 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~q_free~0 1)) (.cse10 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse11 (= ~q_free~0 0)) (.cse8 (not (= 0 ~c_dr_st~0))) (.cse2 (= ~q_buf_0~0 ~p_last_write~0)) (.cse4 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_i~0 1)) (.cse12 (< ~c_num_read~0 ~p_num_write~0)) (.cse15 (= 0 ~q_req_up~0)) (.cse13 (= 2 ~q_read_ev~0)) (.cse14 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_req_up~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ~q_read_ev~0)) (and .cse6 .cse1 .cse11 .cse8 .cse2 .cse4 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 (= ~c_dr_pc~0 1) .cse5 .cse15) (and .cse6 .cse11 .cse1 .cse8 .cse2 .cse4 .cse9 .cse13 .cse15) (and (= ~p_num_write~0 0) .cse7 (= ~q_write_ev~0 ~q_read_ev~0) .cse8 .cse2 .cse3 .cse9 .cse10 (= ~c_num_read~0 0) .cse13 .cse15 (= ~p_dw_pc~0 0)) (and .cse11 (not (= 1 ~c_dr_pc~0)) .cse8 .cse2 .cse9 .cse13) (and .cse1 .cse11 .cse8 .cse2 .cse4 .cse9 .cse12 .cse15 .cse13 .cse14 (not (= 0 ~q_write_ev~0))))) [2021-12-16 01:06:45,831 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2021-12-16 01:06:45,832 INFO L854 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse0 (not (= 0 ~p_dw_st~0))) (.cse1 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse4 (= ~p_dw_i~0 1)) (.cse8 (= ~p_num_write~0 0)) (.cse7 (not (= 1 ~c_dr_pc~0))) (.cse9 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse5 (= ~c_dr_i~0 1)) (.cse10 (= ~c_num_read~0 0)) (.cse6 (= 2 ~q_read_ev~0))) (or (and (<= 2 ~q_write_ev~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_dr_pc~0 1) (< ~c_num_read~0 (+ ~p_num_write~0 1)) .cse6) (and (= ~q_free~0 0) .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse0 .cse7 .cse1 .cse9 .cse3 .cse4 .cse5 .cse10 .cse6) (and .cse8 .cse7 .cse9 .cse2 .cse3 .cse5 .cse10 .cse6))) [2021-12-16 01:06:45,832 INFO L854 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (= ~p_dw_pc~0 0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse13 (not (= 0 ~p_dw_st~0))) (.cse22 (not (= 1 ~c_dr_pc~0))) (.cse15 (= ~q_req_up~0 1)) (.cse18 (= ~q_free~0 0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (= ~c_num_read~0 0)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (not (= 0 ~c_dr_st~0))) (.cse1 (= ~q_buf_0~0 ~p_last_write~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~p_dw_i~0 1)) (.cse8 (= ~c_dr_i~0 1)) (.cse19 (= ~c_dr_pc~0 1)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse4 (= 0 ~q_req_up~0)) (.cse11 (= 2 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse6 .cse17 .cse8 .cse9 (<= 1 ~q_read_ev~0)) (and .cse13 .cse18 .cse17 .cse1 .cse3 .cse8 .cse19 .cse20 .cse4 .cse11 .cse21 (not (= 0 ~q_write_ev~0))) (and .cse16 .cse13 .cse18 .cse17 .cse1 .cse3 .cse8 .cse9 .cse20 .cse11 .cse21) (and .cse12 .cse16 .cse13 .cse17 .cse1 .cse2 .cse3 .cse8 .cse19 .cse14 .cse4) (and .cse16 .cse18 .cse13 .cse17 .cse1 .cse3 .cse8 .cse11 .cse4) (and .cse0 .cse6 .cse7 .cse17 .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse4 .cse5) (and .cse18 .cse22 .cse17 .cse1 .cse8 .cse11) (and .cse16 .cse13 .cse18 .cse1 .cse3 .cse8 .cse19 .cse20 .cse4 .cse11 .cse21) (and .cse13 .cse22 .cse1 .cse3 .cse15 (<= 1 ~p_num_write~0) (<= ~p_num_write~0 1) .cse18 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse7 .cse8 .cse10 .cse11) (and .cse16 .cse12 .cse17 .cse1 .cse2 .cse3 .cse8 .cse19 .cse14 .cse4 .cse11))) [2021-12-16 01:06:45,832 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-12-16 01:06:45,832 INFO L854 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~q_buf_0~0 ~p_last_write~0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) [2021-12-16 01:06:45,832 INFO L854 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse9 (not (= 1 ~c_dr_pc~0))) (.cse0 (<= 2 ~q_write_ev~0)) (.cse2 (= ~q_free~0 0)) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse3 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse4 (not (= 0 ~c_dr_st~0))) (.cse5 (= ~q_buf_0~0 ~p_last_write~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (= ~c_dr_i~0 1)) (.cse8 (= 2 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (< ~c_num_read~0 ~p_num_write~0) .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse2 .cse9 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse9 .cse5 .cse6 (= ~q_req_up~0 1) (<= 1 ~p_num_write~0) (<= ~p_num_write~0 1) .cse2 .cse3 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_num_read~0 0) .cse8) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~q_req_up~0)))) [2021-12-16 01:06:45,832 INFO L854 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~q_buf_0~0 ~p_last_write~0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) [2021-12-16 01:06:45,832 INFO L854 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (= ~p_dw_pc~0 0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse13 (not (= 0 ~p_dw_st~0))) (.cse22 (not (= 1 ~c_dr_pc~0))) (.cse15 (= ~q_req_up~0 1)) (.cse18 (= ~q_free~0 0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (= ~c_num_read~0 0)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (not (= 0 ~c_dr_st~0))) (.cse1 (= ~q_buf_0~0 ~p_last_write~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~p_dw_i~0 1)) (.cse8 (= ~c_dr_i~0 1)) (.cse19 (= ~c_dr_pc~0 1)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse4 (= 0 ~q_req_up~0)) (.cse11 (= 2 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse6 .cse17 .cse8 .cse9 (<= 1 ~q_read_ev~0)) (and .cse13 .cse18 .cse17 .cse1 .cse3 .cse8 .cse19 .cse20 .cse4 .cse11 .cse21 (not (= 0 ~q_write_ev~0))) (and .cse16 .cse13 .cse18 .cse17 .cse1 .cse3 .cse8 .cse9 .cse20 .cse11 .cse21) (and .cse12 .cse16 .cse13 .cse17 .cse1 .cse2 .cse3 .cse8 .cse19 .cse14 .cse4) (and .cse16 .cse18 .cse13 .cse17 .cse1 .cse3 .cse8 .cse11 .cse4) (and .cse18 .cse22 .cse17 .cse1 .cse8 .cse11) (and .cse0 .cse6 .cse7 .cse17 .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse4 .cse5) (and .cse16 .cse13 .cse18 .cse1 .cse3 .cse8 .cse19 .cse20 .cse4 .cse11 .cse21) (and .cse13 .cse22 .cse1 .cse3 .cse15 (<= 1 ~p_num_write~0) (<= ~p_num_write~0 1) .cse18 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse7 .cse8 .cse10 .cse11) (and .cse16 .cse12 .cse17 .cse1 .cse2 .cse3 .cse8 .cse19 .cse14 .cse4 .cse11))) [2021-12-16 01:06:45,833 INFO L854 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2021-12-16 01:06:45,833 INFO L854 garLoopResultBuilder]: At program point L208-1(lines 168 216) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 1)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse13 (not (= 1 ~c_dr_pc~0))) (.cse2 (= ~q_buf_0~0 ~p_last_write~0)) (.cse3 (= ~p_dw_i~0 1)) (.cse6 (= ~q_req_up~0 1)) (.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse9 (not (= 0 ~c_dr_st~0))) (.cse10 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~c_dr_i~0 1)) (.cse14 (= ~c_num_read~0 0)) (.cse12 (= 2 ~q_read_ev~0))) (or (and (<= 2 ~q_write_ev~0) (let ((.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse7 .cse1 .cse8 .cse9 .cse2 .cse4 .cse3 .cse11 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse6))) (<= 1 ~q_read_ev~0)) (and (= ~p_num_write~0 0) .cse13 .cse2 .cse4 .cse3 (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~p_dw_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse6 (<= 1 ~p_num_write~0) (<= ~p_num_write~0 1) (= ~q_free~0 0) .cse8 .cse9 .cse10 .cse11 .cse14 .cse12))) [2021-12-16 01:06:45,833 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (<= 2 ~q_write_ev~0)) (.cse4 (= ~q_free~0 1)) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse8 (= ~q_free~0 0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse5 (= ~p_dw_i~0 1)) (.cse6 (= ~c_dr_i~0 1)) (.cse7 (= 0 ~q_req_up~0)) (.cse9 (= 2 ~q_read_ev~0))) (or (and (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 1) (< ~c_num_read~0 (+ ~p_num_write~0 1)) .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 .cse7) (and .cse8 (not (= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse6 .cse9) (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse3 .cse4 .cse6 (= ~c_dr_pc~0 ~q_req_up~0) (= ~c_num_read~0 0) .cse9 .cse7 (= ~p_dw_pc~0 0)) (and .cse1 .cse8 .cse2 .cse3 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2021-12-16 01:06:45,833 INFO L854 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse0 (<= 2 ~q_write_ev~0)) (.cse4 (= ~q_free~0 1)) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse8 (= ~q_free~0 0)) (.cse2 (not (= 0 ~c_dr_st~0))) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse5 (= ~p_dw_i~0 1)) (.cse6 (= ~c_dr_i~0 1)) (.cse7 (= 0 ~q_req_up~0)) (.cse9 (= 2 ~q_read_ev~0))) (or (and (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 1) (< ~c_num_read~0 (+ ~p_num_write~0 1)) .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 .cse7) (and (= ~p_num_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse3 .cse4 .cse6 (= ~c_dr_pc~0 ~q_req_up~0) (= ~c_num_read~0 0) .cse9 .cse7 (= ~p_dw_pc~0 0)) (and .cse8 (not (= 1 ~c_dr_pc~0)) .cse2 .cse3 .cse6 .cse9) (and .cse1 .cse8 .cse2 .cse3 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) (not (= 0 ~q_write_ev~0))))) [2021-12-16 01:06:45,833 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2021-12-16 01:06:45,833 INFO L858 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2021-12-16 01:06:45,833 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 61 79) no Hoare annotation was computed. [2021-12-16 01:06:45,834 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2021-12-16 01:06:45,834 INFO L854 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse23 (= ~c_dr_pc~0 1)) (.cse20 (<= 0 is_do_write_p_triggered_~__retres1~0)) (.cse22 (= ~c_dr_i~0 1)) (.cse21 (<= is_do_write_p_triggered_~__retres1~0 0)) (.cse25 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse24 (= 0 ~q_req_up~0)) (.cse26 (= ~q_write_ev~0 ~q_read_ev~0))) (let ((.cse0 (not .cse26)) (.cse1 (and .cse26 .cse20 .cse22 .cse21 .cse25 .cse24)) (.cse2 (not (= ~q_free~0 1))) (.cse4 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not .cse25)) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse14 (= 0 ~p_dw_st~0)) (.cse11 (not .cse24)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~q_write_ev~0))) (.cse13 (not .cse23)) (.cse17 (and .cse20 .cse22 .cse23 .cse21 .cse24)) (.cse16 (not (= ~q_free~0 0))) (.cse3 (not .cse22)) (.cse5 (= 0 ~c_dr_st~0)) (.cse19 (and .cse20 .cse21)) (.cse6 (not (= 2 ~q_read_ev~0))) (.cse7 (not (= ~q_buf_0~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (= 0 ~q_write_ev~0) .cse5 .cse13 .cse3 .cse6 .cse7 .cse14 .cse15 .cse16 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse11 .cse17 (not (< ~c_num_read~0 ~p_num_write~0))) (or .cse2 (= ~q_read_ev~0 1) .cse18 .cse5 .cse13 .cse3 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse7 .cse14 .cse15 .cse11 .cse19 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse6 .cse7 .cse8 .cse9 (not (= ~p_dw_st~0 0)) .cse10 .cse15 .cse11 .cse12) (or .cse14 .cse16 .cse11 .cse15 .cse18 .cse13 .cse3 .cse5 .cse17 .cse6 .cse7) (or (= 1 ~c_dr_pc~0) .cse16 .cse3 .cse5 .cse19 .cse6 .cse7)))) [2021-12-16 01:06:45,834 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 61 79) the Hoare annotation is: true [2021-12-16 01:06:45,834 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2021-12-16 01:06:45,834 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2021-12-16 01:06:45,834 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-12-16 01:06:45,834 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2021-12-16 01:06:45,834 INFO L858 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2021-12-16 01:06:45,837 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] [2021-12-16 01:06:45,838 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:06:45,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:06:45 BoogieIcfgContainer [2021-12-16 01:06:45,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:06:45,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:06:45,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:06:45,884 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:06:45,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:06:17" (3/4) ... [2021-12-16 01:06:45,889 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 01:06:45,893 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-16 01:06:45,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-16 01:06:45,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-16 01:06:45,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-16 01:06:45,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-16 01:06:45,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-16 01:06:45,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-16 01:06:45,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2021-12-16 01:06:45,899 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-16 01:06:45,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-16 01:06:45,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 01:06:45,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 01:06:45,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(c_dr_pc == \old(q_req_up)) || 0 == p_dw_st) || !(q_free == 0)) || !(p_num_write <= c_num_read + 1)) || !(p_dw_i == 1)) || (0 == q_req_up && \old(q_read_ev) == q_read_ev)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(2 <= \old(q_write_ev))) || !(c_num_read < p_num_write)) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev))) && (((((((((((!(c_dr_pc == \old(q_req_up)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(q_free == 1)) || !(\old(q_write_ev) == \old(q_read_ev))) || !(c_dr_i == 1)) || !(p_num_write == 0)) || 0 == c_dr_st) || !(q_buf_0 == p_last_write)) || !(p_dw_pc == 0)) || !(2 == \old(q_read_ev)))) && ((((((1 == c_dr_pc || !(0 == \old(q_req_up))) || !(q_free == 0)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && (((((((((((((!(c_dr_pc == \old(q_req_up)) || !(q_free == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(1 <= \old(q_read_ev))) || !(p_num_write <= c_num_read)) || !(q_buf_0 == p_last_write)) || (q_write_ev == \old(q_write_ev) && 0 == q_req_up)) || 0 == p_dw_st) || !(c_last_read == p_last_write)) || !(p_dw_i == 1)) || !(2 <= \old(q_write_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1))) && ((((((((((0 == p_dw_st || !(0 == \old(q_req_up))) || !(p_dw_i == 1)) || !(q_free == 0)) || !(p_num_write <= c_num_read + 1)) || 0 == \old(q_write_ev)) || 0 == c_dr_st) || !(c_dr_i == 1)) || !(c_num_read < p_num_write)) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && ((((((((0 == p_dw_st || !(0 == \old(q_req_up))) || !(q_free == 0)) || !(p_dw_i == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(2 <= \old(q_write_ev))) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && ((((((1 == c_dr_pc || !(q_free == 0)) || (0 == q_req_up && \old(q_read_ev) == q_read_ev)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && ((((((((((((!(c_dr_pc == \old(q_req_up)) || !(q_free == 1)) || !(\old(q_write_ev) == \old(q_read_ev))) || !(p_num_write == 0)) || !(c_dr_i == 1)) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev))) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(p_dw_st == 0)) || !(p_dw_i == 1)) || !(p_dw_pc == 0))) && ((((((((((0 == p_dw_st || !(0 == \old(q_req_up))) || !(q_free == 1)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || !(2 <= \old(q_write_ev))) || !(p_num_write <= c_num_read)) || !(q_buf_0 == p_last_write)) || !(c_num_read < p_num_write + 1)) [2021-12-16 01:06:45,949 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:06:45,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:06:45,949 INFO L158 Benchmark]: Toolchain (without parser) took 29505.60ms. Allocated memory was 121.6MB in the beginning and 994.1MB in the end (delta: 872.4MB). Free memory was 85.4MB in the beginning and 772.0MB in the end (delta: -686.5MB). Peak memory consumption was 185.4MB. Max. memory is 16.1GB. [2021-12-16 01:06:45,950 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:06:45,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.62ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 94.3MB in the end (delta: -9.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:45,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.86ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:45,951 INFO L158 Benchmark]: Boogie Preprocessor took 33.27ms. Allocated memory is still 121.6MB. Free memory was 92.2MB in the beginning and 91.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:06:45,951 INFO L158 Benchmark]: RCFGBuilder took 368.37ms. Allocated memory is still 121.6MB. Free memory was 90.7MB in the beginning and 76.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-16 01:06:45,952 INFO L158 Benchmark]: TraceAbstraction took 28686.21ms. Allocated memory was 121.6MB in the beginning and 994.1MB in the end (delta: 872.4MB). Free memory was 75.5MB in the beginning and 781.4MB in the end (delta: -705.9MB). Peak memory consumption was 610.2MB. Max. memory is 16.1GB. [2021-12-16 01:06:45,952 INFO L158 Benchmark]: Witness Printer took 65.34ms. Allocated memory is still 994.1MB. Free memory was 781.4MB in the beginning and 772.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 01:06:45,954 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.62ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 94.3MB in the end (delta: -9.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.86ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.27ms. Allocated memory is still 121.6MB. Free memory was 92.2MB in the beginning and 91.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.37ms. Allocated memory is still 121.6MB. Free memory was 90.7MB in the beginning and 76.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28686.21ms. Allocated memory was 121.6MB in the beginning and 994.1MB in the end (delta: 872.4MB). Free memory was 75.5MB in the beginning and 781.4MB in the end (delta: -705.9MB). Peak memory consumption was 610.2MB. Max. memory is 16.1GB. * Witness Printer took 65.34ms. Allocated memory is still 994.1MB. Free memory was 781.4MB in the beginning and 772.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 28.6s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8794 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8617 mSDsluCounter, 10069 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6987 mSDsCounter, 2505 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8154 IncrementalHoareTripleChecker+Invalid, 10659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2505 mSolverCounterUnsat, 3082 mSDtfsCounter, 8154 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1928 GetRequests, 1595 SyntacticMatches, 14 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7497occurred in iteration=12, 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: 1.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 4916 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 6270 PreInvPairs, 6681 NumberOfFragments, 7595 HoareAnnotationTreeSize, 6270 FomulaSimplifications, 291 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 41 FomulaSimplificationsInter, 440190 FormulaSimplificationTreeSizeReductionInter, 10.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2535 NumberOfCodeBlocks, 2535 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2994 ConstructedInterpolants, 0 QuantifiedInterpolants, 6170 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1988 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1492/1543 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: (((2 <= q_write_ev && (((((((((((((p_num_write <= c_num_read && !(0 == p_dw_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_free == 1) && c_num_read < p_num_write + 1) && q_req_up == 1) && c_last_read == p_last_write) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_write_ev == q_read_ev) && c_dr_i == 1) && 2 == q_read_ev) || (((((((((((p_num_write <= c_num_read && c_last_read == p_last_write) && !(0 == p_dw_st)) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read < p_num_write + 1) && q_req_up == 1))) && 1 <= q_read_ev) || ((((((((((((((p_num_write == 0 && !(1 == c_dr_pc)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && p_dw_st == 0) && 0 == q_req_up) && p_dw_pc == 0) && c_last_read == p_last_write) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && 2 == q_read_ev)) || (((((((((((((!(0 == p_dw_st) && !(1 == c_dr_pc)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_req_up == 1) && 1 <= p_num_write) && p_num_write <= 1) && q_free == 0) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && 2 == q_read_ev) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == p_dw_st) && q_free == 0) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) && !(0 == q_write_ev)) || ((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 0 == q_req_up)) || ((((((((((2 <= q_write_ev && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_free == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 2 == q_read_ev) && 0 == q_req_up)) || ((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && 2 == q_read_ev) && 0 == q_req_up)) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || (((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read == 0) && 2 == q_read_ev) && 0 == q_req_up) && p_dw_pc == 0)) || ((((((((((2 <= q_write_ev && !(0 == p_dw_st)) && q_free == 0) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((((p_num_write <= c_num_read && !(0 == p_dw_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read < p_num_write + 1) && q_req_up == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && !(0 == c_dr_st)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 1 <= q_read_ev) || ((((((((((2 <= q_write_ev && !(0 == p_dw_st)) && q_free == 0) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read < p_num_write) && 2 == q_read_ev) && p_num_write <= c_num_read + 1)) || ((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 0 == q_req_up)) || ((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && 2 == q_read_ev) && 0 == q_req_up)) || (((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read == 0) && 2 == q_read_ev) && 0 == q_req_up) && p_dw_pc == 0)) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || ((((((((((!(0 == p_dw_st) && q_free == 0) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) && !(0 == q_write_ev)) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: c_dr_i == 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && p_dw_st == 0) && 0 == q_req_up) && p_dw_pc == 0) && c_last_read == p_last_write) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read == 0) && 2 == q_read_ev) || (((((((((((((p_num_write <= c_num_read && !(0 == p_dw_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read < p_num_write + 1) && q_req_up == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 <= tmp___1) && !(0 == c_dr_st)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 1 <= q_read_ev) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && p_num_write <= c_num_read + 1) && 1 <= q_read_ev - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == p_dw_st) && q_free == 0) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) && !(0 == q_write_ev)) || ((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 0 == q_req_up)) || ((((((((((2 <= q_write_ev && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_free == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 2 == q_read_ev) && 0 == q_req_up)) || ((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && 2 == q_read_ev) && 0 == q_req_up)) || (((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read == 0) && 2 == q_read_ev) && 0 == q_req_up) && p_dw_pc == 0)) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || ((((((((((2 <= q_write_ev && !(0 == p_dw_st)) && q_free == 0) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_num_read < p_num_write) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) && q_req_up == 1) || (((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && 0 == q_req_up) && 2 == q_read_ev)) || (((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read == 0) && 2 == q_read_ev) && 0 == q_req_up) && p_dw_pc == 0)) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || (((((((((((((p_num_write == 0 && !(0 == p_dw_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && 0 == q_req_up) && p_dw_pc == 0) && c_last_read == p_last_write) && 1 <= tmp___1) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && c_dr_pc == q_req_up) && 2 == q_read_ev)) || ((((((((((((!(0 == p_dw_st) && !(1 == c_dr_pc)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_req_up == 1) && 1 <= p_num_write) && p_num_write <= 1) && q_free == 0) && 1 <= tmp___1) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && 2 == q_read_ev)) || (((((((((((2 <= q_write_ev && p_num_write <= c_num_read) && !(0 == p_dw_st)) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_free == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 2 == q_read_ev) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((!(q_write_ev == q_read_ev) || !(q_free == 1)) || !(p_num_write == 0)) || 0 == c_dr_st) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || (((((0 <= __retres1 && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && __retres1 <= 0) && 0 == q_req_up)) || !(0 == q_req_up)) || !(c_dr_pc == q_req_up)) || !(p_dw_pc == 0)) && ((((((((((0 == p_dw_st || !(p_dw_i == 1)) || !(q_free == 0)) || !(0 == q_req_up)) || !(2 <= q_write_ev)) || 0 == c_dr_st) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || ((((0 <= __retres1 && c_dr_i == 1) && c_dr_pc == 1) && __retres1 <= 0) && 0 == q_req_up)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write))) && (((((((((((((!(q_write_ev == q_read_ev) || !(q_free == 1)) || !(p_num_write == 0)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || (((((0 <= __retres1 && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && __retres1 <= 0) && 0 == q_req_up)) || !(p_dw_st == 0)) || !(0 == q_req_up)) || !(c_dr_pc == q_req_up)) || !(p_dw_i == 1)) || !(p_dw_pc == 0))) && (((((((((((((((0 <= __retres1 && c_dr_pc == 1) && c_dr_i == 1) && __retres1 <= 0) && 0 == q_req_up) || !(q_free == 1)) || !(p_dw_i == 1)) || !(0 == q_req_up)) || !(2 <= q_write_ev)) || 0 == c_dr_st) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || !(p_num_write <= c_num_read)) || !(q_read_ev == 1)) || !(q_buf_0 == p_last_write)) || !(c_num_read < p_num_write + 1))) && (((((((((((((((0 <= __retres1 && c_dr_pc == 1) && c_dr_i == 1) && __retres1 <= 0) && 0 == q_req_up) || 0 == p_dw_st) || !(q_free == 1)) || !(p_dw_i == 1)) || !(0 == q_req_up)) || !(2 <= q_write_ev)) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(p_num_write <= c_num_read)) || !(q_buf_0 == p_last_write)) || !(c_num_read < p_num_write + 1))) && (((((((((((((0 == q_write_ev || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || ((((0 <= __retres1 && c_dr_i == 1) && c_dr_pc == 1) && __retres1 <= 0) && 0 == q_req_up)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || 0 == p_dw_st) || 0 < q_write_ev) || !(p_dw_i == 1)) || !(q_free == 0)) || !(p_num_write <= c_num_read + 1)) || !(0 == q_req_up)) || !(c_num_read < p_num_write))) && ((((((1 == c_dr_pc || !(q_free == 0)) || !(c_dr_i == 1)) || 0 == c_dr_st) || (0 <= __retres1 && __retres1 <= 0)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(c_dr_pc == \old(q_req_up)) || 0 == p_dw_st) || !(q_free == 0)) || !(p_num_write <= c_num_read + 1)) || !(p_dw_i == 1)) || (0 == q_req_up && \old(q_read_ev) == q_read_ev)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(2 <= \old(q_write_ev))) || !(c_num_read < p_num_write)) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev))) && (((((((((((!(c_dr_pc == \old(q_req_up)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(q_free == 1)) || !(\old(q_write_ev) == \old(q_read_ev))) || !(c_dr_i == 1)) || !(p_num_write == 0)) || 0 == c_dr_st) || !(q_buf_0 == p_last_write)) || !(p_dw_pc == 0)) || !(2 == \old(q_read_ev)))) && ((((((1 == c_dr_pc || !(0 == \old(q_req_up))) || !(q_free == 0)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && (((((((((((((!(c_dr_pc == \old(q_req_up)) || !(q_free == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(1 <= \old(q_read_ev))) || !(p_num_write <= c_num_read)) || !(q_buf_0 == p_last_write)) || (q_write_ev == \old(q_write_ev) && 0 == q_req_up)) || 0 == p_dw_st) || !(c_last_read == p_last_write)) || !(p_dw_i == 1)) || !(2 <= \old(q_write_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1))) && ((((((((((0 == p_dw_st || !(0 == \old(q_req_up))) || !(p_dw_i == 1)) || !(q_free == 0)) || !(p_num_write <= c_num_read + 1)) || 0 == \old(q_write_ev)) || 0 == c_dr_st) || !(c_dr_i == 1)) || !(c_num_read < p_num_write)) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && ((((((((0 == p_dw_st || !(0 == \old(q_req_up))) || !(q_free == 0)) || !(p_dw_i == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(2 <= \old(q_write_ev))) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && ((((((1 == c_dr_pc || !(q_free == 0)) || (0 == q_req_up && \old(q_read_ev) == q_read_ev)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev)))) && ((((((((((((!(c_dr_pc == \old(q_req_up)) || !(q_free == 1)) || !(\old(q_write_ev) == \old(q_read_ev))) || !(p_num_write == 0)) || !(c_dr_i == 1)) || !(q_buf_0 == p_last_write)) || !(2 == \old(q_read_ev))) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || !(0 == \old(q_req_up))) || !(p_dw_st == 0)) || !(p_dw_i == 1)) || !(p_dw_pc == 0))) && ((((((((((0 == p_dw_st || !(0 == \old(q_req_up))) || !(q_free == 1)) || !(p_dw_i == 1)) || 0 == c_dr_st) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || !(2 <= \old(q_write_ev))) || !(p_num_write <= c_num_read)) || !(q_buf_0 == p_last_write)) || !(c_num_read < p_num_write + 1)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((!(0 == p_dw_st) && q_free == 0) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) && !(0 == q_write_ev)) || ((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 0 == q_req_up)) || ((((((((((((p_num_write == 0 && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && p_dw_st == 0) && 0 == q_req_up) && p_dw_pc == 0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && c_dr_pc == q_req_up) && 2 == q_read_ev)) || ((((((((((2 <= q_write_ev && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_free == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 2 == q_read_ev) && 0 == q_req_up)) || ((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && 2 == q_read_ev) && 0 == q_req_up)) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || (((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read == 0) && 2 == q_read_ev) && 0 == q_req_up) && p_dw_pc == 0)) || ((((((((((2 <= q_write_ev && !(0 == p_dw_st)) && q_free == 0) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: c_dr_i == 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((((((((((!(q_write_ev == q_read_ev) || (((((q_write_ev == q_read_ev && 0 <= __retres1) && c_dr_i == 1) && __retres1 <= 0) && c_dr_pc == q_req_up) && 0 == q_req_up)) || !(q_free == 1)) || !(c_dr_i == 1)) || !(p_num_write == 0)) || 0 == c_dr_st) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(p_dw_pc == 0)) && ((((((((((((0 == q_write_ev || 0 == c_dr_st) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || 0 == p_dw_st) || !(p_dw_i == 1)) || !(q_free == 0)) || !(p_num_write <= c_num_read + 1)) || !(0 == q_req_up)) || ((((0 <= __retres1 && c_dr_i == 1) && c_dr_pc == 1) && __retres1 <= 0) && 0 == q_req_up)) || !(c_num_read < p_num_write))) && ((((((((((((!(q_free == 1) || q_read_ev == 1) || !(2 <= q_write_ev)) || 0 == c_dr_st) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || !(p_num_write <= c_num_read)) || !(q_buf_0 == p_last_write)) || 0 == p_dw_st) || !(p_dw_i == 1)) || !(0 == q_req_up)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_num_read < p_num_write + 1))) && (((((((((((((!(q_write_ev == q_read_ev) || (((((q_write_ev == q_read_ev && 0 <= __retres1) && c_dr_i == 1) && __retres1 <= 0) && c_dr_pc == q_req_up) && 0 == q_req_up)) || !(q_free == 1)) || !(p_num_write == 0)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(p_dw_i == 1)) || !(0 == q_req_up)) || !(p_dw_pc == 0))) && ((((((((((0 == p_dw_st || !(q_free == 0)) || !(0 == q_req_up)) || !(p_dw_i == 1)) || !(2 <= q_write_ev)) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || ((((0 <= __retres1 && c_dr_i == 1) && c_dr_pc == 1) && __retres1 <= 0) && 0 == q_req_up)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write))) && ((((((1 == c_dr_pc || !(q_free == 0)) || !(c_dr_i == 1)) || 0 == c_dr_st) || (0 <= __retres1 && __retres1 <= 0)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((!(q_write_ev == q_read_ev) || 1 <= __retres1) || !(q_free == 1)) || !(p_num_write == 0)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || !(c_num_read == 0)) || !(c_last_read == p_last_write)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(p_dw_i == 1)) || !(0 == q_req_up)) || !(p_dw_pc == 0)) && (((((((((((((!(q_write_ev == q_read_ev) || 1 <= __retres1) || !(1 <= p_num_write)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || !(q_req_up == 1)) || 0 == p_dw_st) || !(c_num_read == 0)) || 1 == c_dr_pc) || !(0 == c_dr_st)) || !(q_free == 0)) || !(p_dw_i == 1)) || !(p_num_write <= 1))) && ((((((((((((1 <= __retres1 || !(2 <= q_write_ev)) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || 0 == p_dw_st) || !(0 == c_dr_st)) || !(p_dw_i == 1)) || !(q_free == 0)) || !(p_num_write <= c_num_read + 1)) || !(0 == q_req_up)) || !(c_num_read < p_num_write))) && ((((((((((((!(q_free == 1) || 1 <= __retres1) || !(2 <= q_write_ev)) || !(c_dr_pc == 1)) || !(c_dr_i == 1)) || 0 == c_dr_st) || !(p_num_write <= c_num_read)) || !(2 == q_read_ev)) || !(q_buf_0 == p_last_write)) || !(p_dw_st == 0)) || !(p_dw_i == 1)) || !(0 == q_req_up)) || !(c_num_read < p_num_write + 1)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_num_write == 0 && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && p_dw_st == 0) && 0 == q_req_up) && p_dw_pc == 0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read == 0) && 2 == q_read_ev) || ((((((((((((p_num_write <= c_num_read && !(0 == p_dw_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read < p_num_write + 1) && q_req_up == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && !(0 == c_dr_st)) && c_dr_i == 1) && c_dr_pc == q_req_up) && 1 <= q_read_ev)) || (((((((((((!(0 == p_dw_st) && q_free == 0) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) && !(0 == q_write_ev))) || ((((((((((2 <= q_write_ev && !(0 == p_dw_st)) && q_free == 0) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read < p_num_write) && 2 == q_read_ev) && p_num_write <= c_num_read + 1)) || ((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 0 == q_req_up)) || ((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && 2 == q_read_ev) && 0 == q_req_up)) || (((((((((((p_num_write == 0 && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read == 0) && 2 == q_read_ev) && 0 == q_req_up) && p_dw_pc == 0)) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || ((((((((((2 <= q_write_ev && !(0 == p_dw_st)) && q_free == 0) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write) && 0 == q_req_up) && 2 == q_read_ev) && p_num_write <= c_num_read + 1)) || ((((((((((((!(0 == p_dw_st) && !(1 == c_dr_pc)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_req_up == 1) && 1 <= p_num_write) && p_num_write <= 1) && q_free == 0) && 1 <= tmp___1) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && 2 == q_read_ev)) || ((((((((((2 <= q_write_ev && p_num_write <= c_num_read) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 0 == q_req_up) && 2 == q_read_ev) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((2 <= q_write_ev && p_num_write <= c_num_read) && !(0 == p_dw_st)) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == 1) && c_num_read < p_num_write + 1) && 2 == q_read_ev) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || (((((((((p_num_write == 0 && !(0 == p_dw_st)) && !(1 == c_dr_pc)) && 1 <= tmp___1) && q_write_ev == q_read_ev) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_num_read == 0) && 2 == q_read_ev)) || (((((((p_num_write == 0 && !(1 == c_dr_pc)) && q_write_ev == q_read_ev) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && c_num_read == 0) && 2 == q_read_ev) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && p_dw_st == 0) && 0 == q_req_up) && p_dw_pc == 0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && c_dr_pc == q_req_up) && 2 == q_read_ev - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && q_buf_0 == p_last_write) && q_free == 1) && p_dw_i == 1) && p_dw_st == 0) && 0 == q_req_up) && p_dw_pc == 0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && c_dr_pc == q_req_up) && 2 == q_read_ev - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((2 <= q_write_ev && !(0 == p_dw_st)) && q_free == 0) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && c_dr_pc == q_req_up) && c_num_read < p_num_write) && 2 == q_read_ev) && p_num_write <= c_num_read + 1) || (((((q_free == 0 && !(1 == c_dr_pc)) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && c_dr_i == 1) && 2 == q_read_ev)) || ((((((((((((!(0 == p_dw_st) && !(1 == c_dr_pc)) && q_buf_0 == p_last_write) && p_dw_i == 1) && q_req_up == 1) && 1 <= p_num_write) && p_num_write <= 1) && q_free == 0) && 1 <= tmp___1) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_num_read == 0) && 2 == q_read_ev)) || (((((((((2 <= q_write_ev && q_free == 0) && !(0 == p_dw_st)) && 1 <= tmp___1) && !(0 == c_dr_st)) && q_buf_0 == p_last_write) && p_dw_i == 1) && c_dr_i == 1) && 2 == q_read_ev) && 0 == q_req_up) RESULT: Ultimate proved your program to be correct! [2021-12-16 01:06:46,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE