./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.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/combinations/pc_sfifo_3.cil+token_ring.01.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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 21:07:42,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 21:07:42,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 21:07:42,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 21:07:42,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 21:07:42,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 21:07:42,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 21:07:42,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 21:07:42,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 21:07:42,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 21:07:42,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 21:07:42,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 21:07:42,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 21:07:42,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 21:07:42,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 21:07:42,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 21:07:42,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 21:07:42,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 21:07:42,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 21:07:42,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 21:07:42,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 21:07:42,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 21:07:42,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 21:07:42,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 21:07:42,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 21:07:42,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 21:07:42,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 21:07:42,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 21:07:42,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 21:07:42,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 21:07:42,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 21:07:42,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 21:07:42,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 21:07:42,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 21:07:42,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 21:07:42,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 21:07:42,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 21:07:42,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 21:07:42,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 21:07:42,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 21:07:42,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 21:07:42,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 21:07:42,564 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 21:07:42,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 21:07:42,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 21:07:42,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 21:07:42,565 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 21:07:42,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 21:07:42,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 21:07:42,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 21:07:42,566 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 21:07:42,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 21:07:42,567 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 21:07:42,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 21:07:42,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 21:07:42,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 21:07:42,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 21:07:42,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 21:07:42,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 21:07:42,568 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 21:07:42,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 21:07:42,568 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 21:07:42,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 21:07:42,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 21:07:42,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 21:07:42,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 21:07:42,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:07:42,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 21:07:42,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 21:07:42,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 21:07:42,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 21:07:42,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 21:07:42,569 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 21:07:42,570 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 21:07:42,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 21:07:42,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 21:07:42,570 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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2021-12-17 21:07:42,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 21:07:42,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 21:07:42,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 21:07:42,946 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 21:07:42,946 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 21:07:42,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-12-17 21:07:42,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01fab741b/c791c775ceb44b8a863980e5418fa4a2/FLAG676ebdb64 [2021-12-17 21:07:43,420 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 21:07:43,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-12-17 21:07:43,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01fab741b/c791c775ceb44b8a863980e5418fa4a2/FLAG676ebdb64 [2021-12-17 21:07:43,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01fab741b/c791c775ceb44b8a863980e5418fa4a2 [2021-12-17 21:07:43,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 21:07:43,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 21:07:43,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 21:07:43,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 21:07:43,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 21:07:43,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ac934b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43, skipping insertion in model container [2021-12-17 21:07:43,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 21:07:43,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 21:07:43,701 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/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2021-12-17 21:07:43,774 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/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2021-12-17 21:07:43,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:07:43,812 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 21:07:43,823 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/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2021-12-17 21:07:43,854 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/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2021-12-17 21:07:43,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:07:43,885 INFO L208 MainTranslator]: Completed translation [2021-12-17 21:07:43,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43 WrapperNode [2021-12-17 21:07:43,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 21:07:43,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 21:07:43,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 21:07:43,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 21:07:43,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,959 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 440 [2021-12-17 21:07:43,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 21:07:43,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 21:07:43,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 21:07:43,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 21:07:43,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:43,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:44,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:44,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 21:07:44,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 21:07:44,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 21:07:44,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 21:07:44,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (1/1) ... [2021-12-17 21:07:44,021 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:07:44,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:07:44,044 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-17 21:07:44,046 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-17 21:07:44,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 21:07:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 21:07:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 21:07:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-17 21:07:44,146 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-17 21:07:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-17 21:07:44,146 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-17 21:07:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-17 21:07:44,146 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-17 21:07:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-17 21:07:44,147 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-17 21:07:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-17 21:07:44,147 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-17 21:07:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-17 21:07:44,147 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-17 21:07:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-17 21:07:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-17 21:07:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-17 21:07:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-17 21:07:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-17 21:07:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-17 21:07:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-17 21:07:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-17 21:07:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 21:07:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-17 21:07:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-17 21:07:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-17 21:07:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-17 21:07:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 21:07:44,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 21:07:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-17 21:07:44,149 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-17 21:07:44,276 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 21:07:44,278 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 21:07:44,642 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-17 21:07:44,642 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-12-17 21:07:44,665 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 21:07:44,671 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 21:07:44,672 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-17 21:07:44,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:44 BoogieIcfgContainer [2021-12-17 21:07:44,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 21:07:44,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 21:07:44,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 21:07:44,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 21:07:44,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:07:43" (1/3) ... [2021-12-17 21:07:44,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63eefc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:44, skipping insertion in model container [2021-12-17 21:07:44,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:07:43" (2/3) ... [2021-12-17 21:07:44,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63eefc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:07:44, skipping insertion in model container [2021-12-17 21:07:44,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:44" (3/3) ... [2021-12-17 21:07:44,678 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2021-12-17 21:07:44,682 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 21:07:44,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 21:07:44,725 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 21:07:44,729 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-17 21:07:44,730 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 21:07:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-17 21:07:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:44,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:44,750 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] [2021-12-17 21:07:44,751 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:44,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1818445817, now seen corresponding path program 1 times [2021-12-17 21:07:44,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:44,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059609557] [2021-12-17 21:07:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:44,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:45,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:45,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:45,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:07:45,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:45,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059609557] [2021-12-17 21:07:45,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059609557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:45,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:45,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:07:45,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183028098] [2021-12-17 21:07:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:45,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:07:45,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:07:45,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:07:45,252 INFO L87 Difference]: Start difference. First operand has 224 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 182 states have internal predecessors, (270), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:46,122 INFO L93 Difference]: Finished difference Result 562 states and 842 transitions. [2021-12-17 21:07:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:07:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:46,142 INFO L225 Difference]: With dead ends: 562 [2021-12-17 21:07:46,142 INFO L226 Difference]: Without dead ends: 345 [2021-12-17 21:07:46,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:07:46,151 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 556 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:46,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 841 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 21:07:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-17 21:07:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 304. [2021-12-17 21:07:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 246 states have internal predecessors, (347), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2021-12-17 21:07:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2021-12-17 21:07:46,204 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 57 [2021-12-17 21:07:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:46,204 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2021-12-17 21:07:46,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2021-12-17 21:07:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:46,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:46,207 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] [2021-12-17 21:07:46,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 21:07:46,207 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:46,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1564569483, now seen corresponding path program 1 times [2021-12-17 21:07:46,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:46,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135586875] [2021-12-17 21:07:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:46,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:46,367 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-17 21:07:46,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:46,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135586875] [2021-12-17 21:07:46,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135586875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:46,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:46,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:46,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765390168] [2021-12-17 21:07:46,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:46,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:46,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:46,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:46,370 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:47,261 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2021-12-17 21:07:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 21:07:47,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:47,266 INFO L225 Difference]: With dead ends: 636 [2021-12-17 21:07:47,266 INFO L226 Difference]: Without dead ends: 453 [2021-12-17 21:07:47,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:07:47,268 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 533 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:47,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 1139 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 21:07:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-12-17 21:07:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 389. [2021-12-17 21:07:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 309 states have (on average 1.4304207119741101) internal successors, (442), 315 states have internal predecessors, (442), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-12-17 21:07:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 547 transitions. [2021-12-17 21:07:47,297 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 547 transitions. Word has length 57 [2021-12-17 21:07:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:47,297 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 547 transitions. [2021-12-17 21:07:47,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 547 transitions. [2021-12-17 21:07:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:47,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:47,299 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] [2021-12-17 21:07:47,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 21:07:47,300 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash -484818359, now seen corresponding path program 1 times [2021-12-17 21:07:47,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:47,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374913859] [2021-12-17 21:07:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:47,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:47,376 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-17 21:07:47,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:47,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374913859] [2021-12-17 21:07:47,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374913859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:47,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:47,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:47,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424512278] [2021-12-17 21:07:47,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:47,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:47,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:47,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:47,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:47,378 INFO L87 Difference]: Start difference. First operand 389 states and 547 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:48,092 INFO L93 Difference]: Finished difference Result 972 states and 1371 transitions. [2021-12-17 21:07:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 21:07:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:48,096 INFO L225 Difference]: With dead ends: 972 [2021-12-17 21:07:48,096 INFO L226 Difference]: Without dead ends: 704 [2021-12-17 21:07:48,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:07:48,098 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 546 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:48,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1140 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:07:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-12-17 21:07:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 554. [2021-12-17 21:07:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 450 states have internal predecessors, (629), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2021-12-17 21:07:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 778 transitions. [2021-12-17 21:07:48,126 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 778 transitions. Word has length 57 [2021-12-17 21:07:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:48,126 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 778 transitions. [2021-12-17 21:07:48,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 778 transitions. [2021-12-17 21:07:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:48,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:48,129 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] [2021-12-17 21:07:48,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 21:07:48,130 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1382211637, now seen corresponding path program 1 times [2021-12-17 21:07:48,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:48,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416939968] [2021-12-17 21:07:48,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:48,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,212 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-17 21:07:48,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416939968] [2021-12-17 21:07:48,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416939968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:48,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:48,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:48,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323586287] [2021-12-17 21:07:48,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:48,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:48,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:48,223 INFO L87 Difference]: Start difference. First operand 554 states and 778 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:48,684 INFO L93 Difference]: Finished difference Result 1144 states and 1638 transitions. [2021-12-17 21:07:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:07:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:48,688 INFO L225 Difference]: With dead ends: 1144 [2021-12-17 21:07:48,689 INFO L226 Difference]: Without dead ends: 712 [2021-12-17 21:07:48,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-17 21:07:48,699 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 284 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:48,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 1134 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:07:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-12-17 21:07:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 569. [2021-12-17 21:07:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 457 states have (on average 1.4091903719912473) internal successors, (644), 465 states have internal predecessors, (644), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2021-12-17 21:07:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 793 transitions. [2021-12-17 21:07:48,738 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 793 transitions. Word has length 57 [2021-12-17 21:07:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:48,740 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 793 transitions. [2021-12-17 21:07:48,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 793 transitions. [2021-12-17 21:07:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:48,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:48,745 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] [2021-12-17 21:07:48,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 21:07:48,746 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:48,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1454598195, now seen corresponding path program 1 times [2021-12-17 21:07:48,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:48,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229265346] [2021-12-17 21:07:48,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:48,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:48,799 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-17 21:07:48,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:48,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229265346] [2021-12-17 21:07:48,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229265346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:48,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:48,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:07:48,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395647009] [2021-12-17 21:07:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:48,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:07:48,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:07:48,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:07:48,801 INFO L87 Difference]: Start difference. First operand 569 states and 793 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:49,337 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2021-12-17 21:07:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:07:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:49,343 INFO L225 Difference]: With dead ends: 1594 [2021-12-17 21:07:49,343 INFO L226 Difference]: Without dead ends: 1147 [2021-12-17 21:07:49,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 21:07:49,348 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 679 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:49,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 898 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:07:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-12-17 21:07:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 984. [2021-12-17 21:07:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 792 states have (on average 1.393939393939394) internal successors, (1104), 804 states have internal predecessors, (1104), 115 states have call successors, (115), 68 states have call predecessors, (115), 75 states have return successors, (136), 116 states have call predecessors, (136), 113 states have call successors, (136) [2021-12-17 21:07:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1355 transitions. [2021-12-17 21:07:49,391 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1355 transitions. Word has length 57 [2021-12-17 21:07:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:49,391 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1355 transitions. [2021-12-17 21:07:49,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1355 transitions. [2021-12-17 21:07:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:49,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:49,393 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] [2021-12-17 21:07:49,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 21:07:49,393 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1068898126, now seen corresponding path program 1 times [2021-12-17 21:07:49,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:49,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510911732] [2021-12-17 21:07:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:49,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:49,488 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-17 21:07:49,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:49,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510911732] [2021-12-17 21:07:49,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510911732] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:49,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:49,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:07:49,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075690522] [2021-12-17 21:07:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:49,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:07:49,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:07:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:07:49,490 INFO L87 Difference]: Start difference. First operand 984 states and 1355 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:49,977 INFO L93 Difference]: Finished difference Result 2057 states and 2868 transitions. [2021-12-17 21:07:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 21:07:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:49,982 INFO L225 Difference]: With dead ends: 2057 [2021-12-17 21:07:49,983 INFO L226 Difference]: Without dead ends: 1195 [2021-12-17 21:07:49,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:07:49,985 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 250 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:49,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 1112 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:07:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2021-12-17 21:07:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 999. [2021-12-17 21:07:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 807 states have (on average 1.3804213135068153) internal successors, (1114), 819 states have internal predecessors, (1114), 115 states have call successors, (115), 68 states have call predecessors, (115), 75 states have return successors, (136), 116 states have call predecessors, (136), 113 states have call successors, (136) [2021-12-17 21:07:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1365 transitions. [2021-12-17 21:07:50,027 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1365 transitions. Word has length 57 [2021-12-17 21:07:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:50,028 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1365 transitions. [2021-12-17 21:07:50,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1365 transitions. [2021-12-17 21:07:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:50,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:50,029 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] [2021-12-17 21:07:50,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 21:07:50,029 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1302841136, now seen corresponding path program 1 times [2021-12-17 21:07:50,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:50,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619158755] [2021-12-17 21:07:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:50,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:50,097 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-17 21:07:50,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:50,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619158755] [2021-12-17 21:07:50,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619158755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:50,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:50,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:50,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700914469] [2021-12-17 21:07:50,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:50,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:50,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:50,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:50,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:50,100 INFO L87 Difference]: Start difference. First operand 999 states and 1365 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:51,100 INFO L93 Difference]: Finished difference Result 1549 states and 2111 transitions. [2021-12-17 21:07:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 21:07:51,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:51,105 INFO L225 Difference]: With dead ends: 1549 [2021-12-17 21:07:51,105 INFO L226 Difference]: Without dead ends: 1004 [2021-12-17 21:07:51,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-12-17 21:07:51,109 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 750 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:51,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [771 Valid, 911 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 21:07:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-12-17 21:07:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 818. [2021-12-17 21:07:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 660 states have (on average 1.3727272727272728) internal successors, (906), 668 states have internal predecessors, (906), 97 states have call successors, (97), 56 states have call predecessors, (97), 59 states have return successors, (102), 96 states have call predecessors, (102), 95 states have call successors, (102) [2021-12-17 21:07:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1105 transitions. [2021-12-17 21:07:51,139 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1105 transitions. Word has length 57 [2021-12-17 21:07:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:51,140 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 1105 transitions. [2021-12-17 21:07:51,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1105 transitions. [2021-12-17 21:07:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:51,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:51,142 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] [2021-12-17 21:07:51,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 21:07:51,142 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1083986418, now seen corresponding path program 1 times [2021-12-17 21:07:51,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:51,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55641020] [2021-12-17 21:07:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:51,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,213 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-17 21:07:51,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55641020] [2021-12-17 21:07:51,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55641020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:51,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:51,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:51,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995260894] [2021-12-17 21:07:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:51,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:51,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:51,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:51,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:51,215 INFO L87 Difference]: Start difference. First operand 818 states and 1105 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:51,856 INFO L93 Difference]: Finished difference Result 1478 states and 1990 transitions. [2021-12-17 21:07:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:07:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:51,860 INFO L225 Difference]: With dead ends: 1478 [2021-12-17 21:07:51,860 INFO L226 Difference]: Without dead ends: 944 [2021-12-17 21:07:51,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-12-17 21:07:51,862 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 603 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:51,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 1053 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2021-12-17 21:07:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 735. [2021-12-17 21:07:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 594 states have (on average 1.3737373737373737) internal successors, (816), 600 states have internal predecessors, (816), 88 states have call successors, (88), 50 states have call predecessors, (88), 51 states have return successors, (88), 86 states have call predecessors, (88), 86 states have call successors, (88) [2021-12-17 21:07:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 992 transitions. [2021-12-17 21:07:51,890 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 992 transitions. Word has length 57 [2021-12-17 21:07:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:51,890 INFO L470 AbstractCegarLoop]: Abstraction has 735 states and 992 transitions. [2021-12-17 21:07:51,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 992 transitions. [2021-12-17 21:07:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:51,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:51,891 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] [2021-12-17 21:07:51,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 21:07:51,892 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash -661284592, now seen corresponding path program 1 times [2021-12-17 21:07:51,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:51,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445157094] [2021-12-17 21:07:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:51,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:51,974 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-17 21:07:51,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:51,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445157094] [2021-12-17 21:07:51,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445157094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:51,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:51,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:51,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463312480] [2021-12-17 21:07:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:51,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:51,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:51,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:51,976 INFO L87 Difference]: Start difference. First operand 735 states and 992 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:52,628 INFO L93 Difference]: Finished difference Result 1814 states and 2416 transitions. [2021-12-17 21:07:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:07:52,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 21:07:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:52,633 INFO L225 Difference]: With dead ends: 1814 [2021-12-17 21:07:52,633 INFO L226 Difference]: Without dead ends: 1202 [2021-12-17 21:07:52,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-12-17 21:07:52,636 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 734 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:52,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 927 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-12-17 21:07:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 961. [2021-12-17 21:07:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 776 states have (on average 1.3505154639175259) internal successors, (1048), 785 states have internal predecessors, (1048), 113 states have call successors, (113), 66 states have call predecessors, (113), 70 states have return successors, (120), 112 states have call predecessors, (120), 111 states have call successors, (120) [2021-12-17 21:07:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1281 transitions. [2021-12-17 21:07:52,678 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1281 transitions. Word has length 57 [2021-12-17 21:07:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:52,678 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1281 transitions. [2021-12-17 21:07:52,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:07:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1281 transitions. [2021-12-17 21:07:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 21:07:52,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:52,680 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] [2021-12-17 21:07:52,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 21:07:52,680 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1478933042, now seen corresponding path program 1 times [2021-12-17 21:07:52,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:52,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343220012] [2021-12-17 21:07:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:52,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:07:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:07:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:07:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:52,729 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-17 21:07:52,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:52,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343220012] [2021-12-17 21:07:52,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343220012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:52,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:52,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:07:52,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384968573] [2021-12-17 21:07:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:52,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:07:52,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:52,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:07:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:07:52,731 INFO L87 Difference]: Start difference. First operand 961 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 21:07:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:53,101 INFO L93 Difference]: Finished difference Result 2556 states and 3423 transitions. [2021-12-17 21:07:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 21:07:53,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2021-12-17 21:07:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:53,108 INFO L225 Difference]: With dead ends: 2556 [2021-12-17 21:07:53,109 INFO L226 Difference]: Without dead ends: 1718 [2021-12-17 21:07:53,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:07:53,112 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 555 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:53,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 621 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:07:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-12-17 21:07:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1503. [2021-12-17 21:07:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1206 states have (on average 1.3325041459369817) internal successors, (1607), 1224 states have internal predecessors, (1607), 181 states have call successors, (181), 108 states have call predecessors, (181), 114 states have return successors, (190), 173 states have call predecessors, (190), 179 states have call successors, (190) [2021-12-17 21:07:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1978 transitions. [2021-12-17 21:07:53,177 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1978 transitions. Word has length 57 [2021-12-17 21:07:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:53,178 INFO L470 AbstractCegarLoop]: Abstraction has 1503 states and 1978 transitions. [2021-12-17 21:07:53,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-17 21:07:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1978 transitions. [2021-12-17 21:07:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:07:53,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:53,179 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-17 21:07:53,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 21:07:53,180 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1901012817, now seen corresponding path program 1 times [2021-12-17 21:07:53,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:53,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105850353] [2021-12-17 21:07:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:53,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,242 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-17 21:07:53,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:53,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105850353] [2021-12-17 21:07:53,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105850353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:53,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:53,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:53,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481421493] [2021-12-17 21:07:53,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:53,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:53,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:53,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:53,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:53,245 INFO L87 Difference]: Start difference. First operand 1503 states and 1978 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-17 21:07:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:53,838 INFO L93 Difference]: Finished difference Result 1758 states and 2348 transitions. [2021-12-17 21:07:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 21:07:53,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2021-12-17 21:07:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:53,847 INFO L225 Difference]: With dead ends: 1758 [2021-12-17 21:07:53,848 INFO L226 Difference]: Without dead ends: 1654 [2021-12-17 21:07:53,849 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-17 21:07:53,850 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 622 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:53,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 1138 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:07:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2021-12-17 21:07:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1615. [2021-12-17 21:07:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1296 states have (on average 1.337962962962963) internal successors, (1734), 1316 states have internal predecessors, (1734), 194 states have call successors, (194), 115 states have call predecessors, (194), 123 states have return successors, (208), 187 states have call predecessors, (208), 192 states have call successors, (208) [2021-12-17 21:07:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2136 transitions. [2021-12-17 21:07:53,955 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2136 transitions. Word has length 65 [2021-12-17 21:07:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:53,956 INFO L470 AbstractCegarLoop]: Abstraction has 1615 states and 2136 transitions. [2021-12-17 21:07:53,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-17 21:07:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2136 transitions. [2021-12-17 21:07:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:07:53,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:53,958 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-17 21:07:53,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 21:07:53,958 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash -855614449, now seen corresponding path program 1 times [2021-12-17 21:07:53,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:53,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141776622] [2021-12-17 21:07:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:53,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:54,174 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-17 21:07:54,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:54,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141776622] [2021-12-17 21:07:54,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141776622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:54,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:54,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:07:54,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003677284] [2021-12-17 21:07:54,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:54,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:07:54,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:54,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:07:54,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:07:54,177 INFO L87 Difference]: Start difference. First operand 1615 states and 2136 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-17 21:07:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:55,001 INFO L93 Difference]: Finished difference Result 2012 states and 2702 transitions. [2021-12-17 21:07:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 21:07:55,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2021-12-17 21:07:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:55,009 INFO L225 Difference]: With dead ends: 2012 [2021-12-17 21:07:55,009 INFO L226 Difference]: Without dead ends: 1803 [2021-12-17 21:07:55,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-17 21:07:55,011 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 589 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:55,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 1476 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 21:07:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2021-12-17 21:07:55,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1727. [2021-12-17 21:07:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1386 states have (on average 1.341991341991342) internal successors, (1860), 1408 states have internal predecessors, (1860), 207 states have call successors, (207), 122 states have call predecessors, (207), 132 states have return successors, (229), 201 states have call predecessors, (229), 205 states have call successors, (229) [2021-12-17 21:07:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2296 transitions. [2021-12-17 21:07:55,090 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2296 transitions. Word has length 65 [2021-12-17 21:07:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:55,090 INFO L470 AbstractCegarLoop]: Abstraction has 1727 states and 2296 transitions. [2021-12-17 21:07:55,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-17 21:07:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2296 transitions. [2021-12-17 21:07:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:07:55,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:55,092 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-17 21:07:55,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 21:07:55,092 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1410766737, now seen corresponding path program 1 times [2021-12-17 21:07:55,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:55,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138544723] [2021-12-17 21:07:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:55,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:07:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:07:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:07:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:55,218 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-17 21:07:55,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:55,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138544723] [2021-12-17 21:07:55,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138544723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:55,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:55,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 21:07:55,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227103906] [2021-12-17 21:07:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:55,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:07:55,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:07:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:07:55,220 INFO L87 Difference]: Start difference. First operand 1727 states and 2296 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 21:07:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:57,321 INFO L93 Difference]: Finished difference Result 3273 states and 4494 transitions. [2021-12-17 21:07:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 21:07:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2021-12-17 21:07:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:57,331 INFO L225 Difference]: With dead ends: 3273 [2021-12-17 21:07:57,331 INFO L226 Difference]: Without dead ends: 2940 [2021-12-17 21:07:57,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 21:07:57,334 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 1923 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:57,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1941 Valid, 1800 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-17 21:07:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2021-12-17 21:07:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2780. [2021-12-17 21:07:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2234 states have (on average 1.3446732318710832) internal successors, (3004), 2271 states have internal predecessors, (3004), 317 states have call successors, (317), 205 states have call predecessors, (317), 227 states have return successors, (362), 307 states have call predecessors, (362), 315 states have call successors, (362) [2021-12-17 21:07:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 3683 transitions. [2021-12-17 21:07:57,515 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 3683 transitions. Word has length 65 [2021-12-17 21:07:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:57,515 INFO L470 AbstractCegarLoop]: Abstraction has 2780 states and 3683 transitions. [2021-12-17 21:07:57,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-17 21:07:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 3683 transitions. [2021-12-17 21:07:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-17 21:07:57,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:57,516 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] [2021-12-17 21:07:57,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 21:07:57,517 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 679032074, now seen corresponding path program 1 times [2021-12-17 21:07:57,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461850590] [2021-12-17 21:07:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:57,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 21:07:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-17 21:07:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:57,636 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-17 21:07:57,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:57,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461850590] [2021-12-17 21:07:57,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461850590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:57,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:57,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:07:57,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859040881] [2021-12-17 21:07:57,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:57,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:07:57,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:57,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:07:57,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:07:57,638 INFO L87 Difference]: Start difference. First operand 2780 states and 3683 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-17 21:07:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:07:58,540 INFO L93 Difference]: Finished difference Result 4308 states and 5762 transitions. [2021-12-17 21:07:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:07:58,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2021-12-17 21:07:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:07:58,569 INFO L225 Difference]: With dead ends: 4308 [2021-12-17 21:07:58,570 INFO L226 Difference]: Without dead ends: 2928 [2021-12-17 21:07:58,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 21:07:58,587 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 332 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 21:07:58,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1342 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 21:07:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2021-12-17 21:07:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2820. [2021-12-17 21:07:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2266 states have (on average 1.3371579876434245) internal successors, (3030), 2303 states have internal predecessors, (3030), 317 states have call successors, (317), 205 states have call predecessors, (317), 235 states have return successors, (370), 315 states have call predecessors, (370), 315 states have call successors, (370) [2021-12-17 21:07:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3717 transitions. [2021-12-17 21:07:58,915 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3717 transitions. Word has length 66 [2021-12-17 21:07:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:07:58,916 INFO L470 AbstractCegarLoop]: Abstraction has 2820 states and 3717 transitions. [2021-12-17 21:07:58,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-17 21:07:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3717 transitions. [2021-12-17 21:07:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-17 21:07:58,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:07:58,919 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] [2021-12-17 21:07:58,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 21:07:58,919 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:07:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:07:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -350327224, now seen corresponding path program 1 times [2021-12-17 21:07:58,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:07:58,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988043046] [2021-12-17 21:07:58,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:07:58,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:07:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:07:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:07:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:07:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:07:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:07:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 21:07:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-17 21:07:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:07:59,081 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-17 21:07:59,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:07:59,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988043046] [2021-12-17 21:07:59,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988043046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:07:59,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:07:59,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 21:07:59,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783778778] [2021-12-17 21:07:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:07:59,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:07:59,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:07:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:07:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:07:59,084 INFO L87 Difference]: Start difference. First operand 2820 states and 3717 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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-17 21:08:00,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:00,668 INFO L93 Difference]: Finished difference Result 6392 states and 8591 transitions. [2021-12-17 21:08:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 21:08:00,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2021-12-17 21:08:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:00,696 INFO L225 Difference]: With dead ends: 6392 [2021-12-17 21:08:00,696 INFO L226 Difference]: Without dead ends: 3211 [2021-12-17 21:08:00,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 21:08:00,704 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 2229 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:00,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2247 Valid, 1620 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-17 21:08:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2021-12-17 21:08:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 3031. [2021-12-17 21:08:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 2405 states have (on average 1.3122661122661123) internal successors, (3156), 2444 states have internal predecessors, (3156), 357 states have call successors, (357), 233 states have call predecessors, (357), 267 states have return successors, (416), 357 states have call predecessors, (416), 355 states have call successors, (416) [2021-12-17 21:08:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 3929 transitions. [2021-12-17 21:08:00,925 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 3929 transitions. Word has length 66 [2021-12-17 21:08:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:00,926 INFO L470 AbstractCegarLoop]: Abstraction has 3031 states and 3929 transitions. [2021-12-17 21:08:00,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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-17 21:08:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3929 transitions. [2021-12-17 21:08:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:08:00,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:00,928 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:00,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 21:08:00,929 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -906412360, now seen corresponding path program 1 times [2021-12-17 21:08:00,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:00,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494405891] [2021-12-17 21:08:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:00,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:08:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:08:01,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:01,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494405891] [2021-12-17 21:08:01,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494405891] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:01,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:01,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:08:01,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484812303] [2021-12-17 21:08:01,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:01,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:08:01,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:08:01,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:08:01,056 INFO L87 Difference]: Start difference. First operand 3031 states and 3929 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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-17 21:08:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:01,538 INFO L93 Difference]: Finished difference Result 4856 states and 6331 transitions. [2021-12-17 21:08:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:08:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2021-12-17 21:08:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:01,560 INFO L225 Difference]: With dead ends: 4856 [2021-12-17 21:08:01,560 INFO L226 Difference]: Without dead ends: 3225 [2021-12-17 21:08:01,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 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-17 21:08:01,564 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 320 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:01,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 1274 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:08:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2021-12-17 21:08:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3091. [2021-12-17 21:08:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3091 states, 2453 states have (on average 1.3037097431716267) internal successors, (3198), 2492 states have internal predecessors, (3198), 357 states have call successors, (357), 233 states have call predecessors, (357), 279 states have return successors, (428), 369 states have call predecessors, (428), 355 states have call successors, (428) [2021-12-17 21:08:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 3983 transitions. [2021-12-17 21:08:01,683 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 3983 transitions. Word has length 91 [2021-12-17 21:08:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:01,684 INFO L470 AbstractCegarLoop]: Abstraction has 3091 states and 3983 transitions. [2021-12-17 21:08:01,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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-17 21:08:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 3983 transitions. [2021-12-17 21:08:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:08:01,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:01,686 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:01,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 21:08:01,686 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash -462511686, now seen corresponding path program 1 times [2021-12-17 21:08:01,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:01,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474127383] [2021-12-17 21:08:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:01,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:08:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:08:01,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:01,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474127383] [2021-12-17 21:08:01,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474127383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:01,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:01,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:08:01,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331845169] [2021-12-17 21:08:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:01,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:08:01,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:01,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:08:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:01,779 INFO L87 Difference]: Start difference. First operand 3091 states and 3983 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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-17 21:08:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:02,553 INFO L93 Difference]: Finished difference Result 4618 states and 5947 transitions. [2021-12-17 21:08:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:08:02,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2021-12-17 21:08:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:02,598 INFO L225 Difference]: With dead ends: 4618 [2021-12-17 21:08:02,598 INFO L226 Difference]: Without dead ends: 3165 [2021-12-17 21:08:02,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-12-17 21:08:02,610 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 592 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:02,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 1130 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:08:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2021-12-17 21:08:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 2870. [2021-12-17 21:08:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 2285 states have (on average 1.3041575492341357) internal successors, (2980), 2319 states have internal predecessors, (2980), 329 states have call successors, (329), 214 states have call predecessors, (329), 254 states have return successors, (388), 339 states have call predecessors, (388), 327 states have call successors, (388) [2021-12-17 21:08:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 3697 transitions. [2021-12-17 21:08:02,792 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 3697 transitions. Word has length 91 [2021-12-17 21:08:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:02,792 INFO L470 AbstractCegarLoop]: Abstraction has 2870 states and 3697 transitions. [2021-12-17 21:08:02,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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-17 21:08:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 3697 transitions. [2021-12-17 21:08:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:08:02,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:02,794 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:02,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 21:08:02,794 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1476650360, now seen corresponding path program 1 times [2021-12-17 21:08:02,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:02,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213428378] [2021-12-17 21:08:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:02,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:08:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 21:08:02,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:02,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213428378] [2021-12-17 21:08:02,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213428378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:02,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:02,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:08:02,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064997500] [2021-12-17 21:08:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:02,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:08:02,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:08:02,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:02,844 INFO L87 Difference]: Start difference. First operand 2870 states and 3697 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:03,253 INFO L93 Difference]: Finished difference Result 6022 states and 7809 transitions. [2021-12-17 21:08:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:08:03,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2021-12-17 21:08:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:03,264 INFO L225 Difference]: With dead ends: 6022 [2021-12-17 21:08:03,264 INFO L226 Difference]: Without dead ends: 4553 [2021-12-17 21:08:03,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-17 21:08:03,268 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 638 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:03,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 816 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:08:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2021-12-17 21:08:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4339. [2021-12-17 21:08:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 3434 states have (on average 1.283634245777519) internal successors, (4408), 3497 states have internal predecessors, (4408), 490 states have call successors, (490), 327 states have call predecessors, (490), 413 states have return successors, (671), 518 states have call predecessors, (671), 488 states have call successors, (671) [2021-12-17 21:08:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5569 transitions. [2021-12-17 21:08:03,428 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5569 transitions. Word has length 91 [2021-12-17 21:08:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:03,428 INFO L470 AbstractCegarLoop]: Abstraction has 4339 states and 5569 transitions. [2021-12-17 21:08:03,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5569 transitions. [2021-12-17 21:08:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 21:08:03,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:03,430 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:03,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 21:08:03,430 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:03,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash 418812282, now seen corresponding path program 1 times [2021-12-17 21:08:03,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:03,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178591505] [2021-12-17 21:08:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:03,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-17 21:08:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:08:03,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:03,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178591505] [2021-12-17 21:08:03,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178591505] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:03,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:03,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:08:03,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677795426] [2021-12-17 21:08:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:03,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:08:03,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:03,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:08:03,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:08:03,482 INFO L87 Difference]: Start difference. First operand 4339 states and 5569 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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-17 21:08:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:03,734 INFO L93 Difference]: Finished difference Result 5923 states and 7553 transitions. [2021-12-17 21:08:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 21:08:03,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 91 [2021-12-17 21:08:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:03,745 INFO L225 Difference]: With dead ends: 5923 [2021-12-17 21:08:03,745 INFO L226 Difference]: Without dead ends: 2985 [2021-12-17 21:08:03,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:03,751 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 336 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:03,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 734 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 21:08:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2021-12-17 21:08:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2870. [2021-12-17 21:08:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 2285 states have (on average 1.287964989059081) internal successors, (2943), 2319 states have internal predecessors, (2943), 329 states have call successors, (329), 214 states have call predecessors, (329), 254 states have return successors, (388), 339 states have call predecessors, (388), 327 states have call successors, (388) [2021-12-17 21:08:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 3660 transitions. [2021-12-17 21:08:03,865 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 3660 transitions. Word has length 91 [2021-12-17 21:08:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:03,865 INFO L470 AbstractCegarLoop]: Abstraction has 2870 states and 3660 transitions. [2021-12-17 21:08:03,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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-17 21:08:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 3660 transitions. [2021-12-17 21:08:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-17 21:08:03,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:03,868 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:03,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 21:08:03,868 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash -539593956, now seen corresponding path program 1 times [2021-12-17 21:08:03,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:03,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483130670] [2021-12-17 21:08:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:03,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 21:08:03,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:03,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483130670] [2021-12-17 21:08:03,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483130670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:03,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:03,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:08:03,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099516723] [2021-12-17 21:08:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:03,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:08:03,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:08:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:08:03,933 INFO L87 Difference]: Start difference. First operand 2870 states and 3660 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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-17 21:08:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:04,837 INFO L93 Difference]: Finished difference Result 5288 states and 6743 transitions. [2021-12-17 21:08:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-17 21:08:04,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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-17 21:08:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:04,861 INFO L225 Difference]: With dead ends: 5288 [2021-12-17 21:08:04,870 INFO L226 Difference]: Without dead ends: 3668 [2021-12-17 21:08:04,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-17 21:08:04,883 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 1159 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:04,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1190 Valid, 1244 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:08:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2021-12-17 21:08:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3491. [2021-12-17 21:08:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 2752 states have (on average 1.2663517441860466) internal successors, (3485), 2794 states have internal predecessors, (3485), 406 states have call successors, (406), 262 states have call predecessors, (406), 331 states have return successors, (519), 437 states have call predecessors, (519), 404 states have call successors, (519) [2021-12-17 21:08:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 4410 transitions. [2021-12-17 21:08:05,175 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 4410 transitions. Word has length 92 [2021-12-17 21:08:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:05,175 INFO L470 AbstractCegarLoop]: Abstraction has 3491 states and 4410 transitions. [2021-12-17 21:08:05,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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-17 21:08:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4410 transitions. [2021-12-17 21:08:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-17 21:08:05,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:05,177 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:05,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-17 21:08:05,178 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash -837976402, now seen corresponding path program 1 times [2021-12-17 21:08:05,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:05,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349650907] [2021-12-17 21:08:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:05,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:08:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 21:08:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-17 21:08:05,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:05,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349650907] [2021-12-17 21:08:05,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349650907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:05,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:05,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:08:05,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695030401] [2021-12-17 21:08:05,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:05,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:08:05,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:08:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:05,287 INFO L87 Difference]: Start difference. First operand 3491 states and 4410 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:05,722 INFO L93 Difference]: Finished difference Result 6575 states and 8547 transitions. [2021-12-17 21:08:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:08:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2021-12-17 21:08:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:05,743 INFO L225 Difference]: With dead ends: 6575 [2021-12-17 21:08:05,747 INFO L226 Difference]: Without dead ends: 5197 [2021-12-17 21:08:05,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-17 21:08:05,754 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 681 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:05,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 633 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:08:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2021-12-17 21:08:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 4804. [2021-12-17 21:08:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 3785 states have (on average 1.270541611624835) internal successors, (4809), 3852 states have internal predecessors, (4809), 562 states have call successors, (562), 361 states have call predecessors, (562), 455 states have return successors, (772), 595 states have call predecessors, (772), 560 states have call successors, (772) [2021-12-17 21:08:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6143 transitions. [2021-12-17 21:08:05,988 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6143 transitions. Word has length 92 [2021-12-17 21:08:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:05,989 INFO L470 AbstractCegarLoop]: Abstraction has 4804 states and 6143 transitions. [2021-12-17 21:08:05,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6143 transitions. [2021-12-17 21:08:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-17 21:08:05,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:05,992 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-17 21:08:05,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-17 21:08:05,992 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash 486879792, now seen corresponding path program 1 times [2021-12-17 21:08:05,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:05,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535534296] [2021-12-17 21:08:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:05,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:08:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 21:08:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-17 21:08:06,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535534296] [2021-12-17 21:08:06,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535534296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:06,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:06,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:08:06,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791969811] [2021-12-17 21:08:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:06,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:08:06,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:06,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:08:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:08:06,039 INFO L87 Difference]: Start difference. First operand 4804 states and 6143 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:08:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:06,435 INFO L93 Difference]: Finished difference Result 7294 states and 9407 transitions. [2021-12-17 21:08:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:08:06,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2021-12-17 21:08:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:06,447 INFO L225 Difference]: With dead ends: 7294 [2021-12-17 21:08:06,448 INFO L226 Difference]: Without dead ends: 4603 [2021-12-17 21:08:06,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:08:06,455 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 352 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:06,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 580 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:08:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2021-12-17 21:08:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 4283. [2021-12-17 21:08:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4283 states, 3376 states have (on average 1.2654028436018958) internal successors, (4272), 3436 states have internal predecessors, (4272), 494 states have call successors, (494), 320 states have call predecessors, (494), 411 states have return successors, (678), 529 states have call predecessors, (678), 492 states have call successors, (678) [2021-12-17 21:08:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 5444 transitions. [2021-12-17 21:08:06,625 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 5444 transitions. Word has length 92 [2021-12-17 21:08:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:06,626 INFO L470 AbstractCegarLoop]: Abstraction has 4283 states and 5444 transitions. [2021-12-17 21:08:06,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:08:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 5444 transitions. [2021-12-17 21:08:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-17 21:08:06,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:06,629 INFO L514 BasicCegarLoop]: trace histogram [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-17 21:08:06,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-17 21:08:06,630 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash -249307800, now seen corresponding path program 1 times [2021-12-17 21:08:06,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:06,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192004778] [2021-12-17 21:08:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:06,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:08:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 21:08:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:08:06,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:06,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192004778] [2021-12-17 21:08:06,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192004778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:06,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:06,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:08:06,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192358639] [2021-12-17 21:08:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:06,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:08:06,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:08:06,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:06,692 INFO L87 Difference]: Start difference. First operand 4283 states and 5444 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:07,601 INFO L93 Difference]: Finished difference Result 8911 states and 11668 transitions. [2021-12-17 21:08:07,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 21:08:07,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2021-12-17 21:08:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:07,615 INFO L225 Difference]: With dead ends: 8911 [2021-12-17 21:08:07,616 INFO L226 Difference]: Without dead ends: 5729 [2021-12-17 21:08:07,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-12-17 21:08:07,623 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 1296 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:07,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 894 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:08:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2021-12-17 21:08:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5415. [2021-12-17 21:08:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5415 states, 4319 states have (on average 1.2493632785366984) internal successors, (5396), 4401 states have internal predecessors, (5396), 583 states have call successors, (583), 392 states have call predecessors, (583), 511 states have return successors, (814), 624 states have call predecessors, (814), 581 states have call successors, (814) [2021-12-17 21:08:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5415 states to 5415 states and 6793 transitions. [2021-12-17 21:08:07,921 INFO L78 Accepts]: Start accepts. Automaton has 5415 states and 6793 transitions. Word has length 93 [2021-12-17 21:08:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:07,921 INFO L470 AbstractCegarLoop]: Abstraction has 5415 states and 6793 transitions. [2021-12-17 21:08:07,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 21:08:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5415 states and 6793 transitions. [2021-12-17 21:08:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 21:08:07,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:07,925 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:07,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-17 21:08:07,925 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -510308443, now seen corresponding path program 1 times [2021-12-17 21:08:07,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:07,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128403900] [2021-12-17 21:08:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:07,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:08:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:08:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 21:08:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-17 21:08:08,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128403900] [2021-12-17 21:08:08,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128403900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:08,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:08,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:08:08,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040232832] [2021-12-17 21:08:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:08,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:08:08,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:08:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:08,005 INFO L87 Difference]: Start difference. First operand 5415 states and 6793 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:08:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:08,953 INFO L93 Difference]: Finished difference Result 10193 states and 13174 transitions. [2021-12-17 21:08:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 21:08:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 135 [2021-12-17 21:08:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:08,970 INFO L225 Difference]: With dead ends: 10193 [2021-12-17 21:08:08,971 INFO L226 Difference]: Without dead ends: 6952 [2021-12-17 21:08:08,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2021-12-17 21:08:08,981 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 1096 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:08,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1110 Valid, 789 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 21:08:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6952 states. [2021-12-17 21:08:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6952 to 6461. [2021-12-17 21:08:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6461 states, 5193 states have (on average 1.2222222222222223) internal successors, (6347), 5312 states have internal predecessors, (6347), 652 states have call successors, (652), 461 states have call predecessors, (652), 614 states have return successors, (929), 690 states have call predecessors, (929), 650 states have call successors, (929) [2021-12-17 21:08:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6461 states to 6461 states and 7928 transitions. [2021-12-17 21:08:09,377 INFO L78 Accepts]: Start accepts. Automaton has 6461 states and 7928 transitions. Word has length 135 [2021-12-17 21:08:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:09,377 INFO L470 AbstractCegarLoop]: Abstraction has 6461 states and 7928 transitions. [2021-12-17 21:08:09,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 6 states have internal predecessors, (86), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:08:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6461 states and 7928 transitions. [2021-12-17 21:08:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 21:08:09,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:09,382 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:09,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-17 21:08:09,382 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -952760958, now seen corresponding path program 2 times [2021-12-17 21:08:09,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:09,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940544471] [2021-12-17 21:08:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:09,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:08:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:08:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 21:08:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-17 21:08:09,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:09,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940544471] [2021-12-17 21:08:09,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940544471] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:09,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363789650] [2021-12-17 21:08:09,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 21:08:09,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:09,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:09,460 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-17 21:08:09,464 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-17 21:08:09,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 21:08:09,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 21:08:09,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:08:09,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 21:08:09,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:09,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363789650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:09,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:09,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-17 21:08:09,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113078952] [2021-12-17 21:08:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:09,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:09,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:08:09,766 INFO L87 Difference]: Start difference. First operand 6461 states and 7928 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:08:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:10,007 INFO L93 Difference]: Finished difference Result 9573 states and 11921 transitions. [2021-12-17 21:08:10,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:10,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2021-12-17 21:08:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:10,028 INFO L225 Difference]: With dead ends: 9573 [2021-12-17 21:08:10,028 INFO L226 Difference]: Without dead ends: 6315 [2021-12-17 21:08:10,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:08:10,034 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 78 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:10,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 650 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6315 states. [2021-12-17 21:08:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6315 to 6293. [2021-12-17 21:08:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6293 states, 5025 states have (on average 1.2117412935323384) internal successors, (6089), 5144 states have internal predecessors, (6089), 652 states have call successors, (652), 461 states have call predecessors, (652), 614 states have return successors, (929), 690 states have call predecessors, (929), 650 states have call successors, (929) [2021-12-17 21:08:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6293 states to 6293 states and 7670 transitions. [2021-12-17 21:08:10,410 INFO L78 Accepts]: Start accepts. Automaton has 6293 states and 7670 transitions. Word has length 135 [2021-12-17 21:08:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:10,410 INFO L470 AbstractCegarLoop]: Abstraction has 6293 states and 7670 transitions. [2021-12-17 21:08:10,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:08:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6293 states and 7670 transitions. [2021-12-17 21:08:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-17 21:08:10,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:10,417 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:10,446 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-17 21:08:10,633 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,SelfDestructingSolverStorable24 [2021-12-17 21:08:10,634 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1471946848, now seen corresponding path program 1 times [2021-12-17 21:08:10,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:10,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090674800] [2021-12-17 21:08:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:10,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:08:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:08:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:08:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-17 21:08:10,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090674800] [2021-12-17 21:08:10,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090674800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:10,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:10,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:08:10,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769959969] [2021-12-17 21:08:10,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:10,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:08:10,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:08:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:08:10,756 INFO L87 Difference]: Start difference. First operand 6293 states and 7670 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 21:08:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:11,832 INFO L93 Difference]: Finished difference Result 13891 states and 17061 transitions. [2021-12-17 21:08:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 21:08:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2021-12-17 21:08:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:11,863 INFO L225 Difference]: With dead ends: 13891 [2021-12-17 21:08:11,864 INFO L226 Difference]: Without dead ends: 11076 [2021-12-17 21:08:11,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-17 21:08:11,874 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 773 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:11,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [811 Valid, 866 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:08:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11076 states. [2021-12-17 21:08:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11076 to 9227. [2021-12-17 21:08:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9227 states, 7440 states have (on average 1.2248655913978495) internal successors, (9113), 7632 states have internal predecessors, (9113), 907 states have call successors, (907), 649 states have call predecessors, (907), 878 states have return successors, (1332), 948 states have call predecessors, (1332), 905 states have call successors, (1332) [2021-12-17 21:08:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9227 states to 9227 states and 11352 transitions. [2021-12-17 21:08:12,373 INFO L78 Accepts]: Start accepts. Automaton has 9227 states and 11352 transitions. Word has length 136 [2021-12-17 21:08:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:12,374 INFO L470 AbstractCegarLoop]: Abstraction has 9227 states and 11352 transitions. [2021-12-17 21:08:12,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 21:08:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9227 states and 11352 transitions. [2021-12-17 21:08:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-17 21:08:12,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:12,382 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:12,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-17 21:08:12,383 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1293563630, now seen corresponding path program 1 times [2021-12-17 21:08:12,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:12,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873749130] [2021-12-17 21:08:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:12,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:08:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 21:08:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-17 21:08:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 21:08:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 21:08:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 21:08:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:08:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-17 21:08:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 21:08:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-17 21:08:12,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:12,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873749130] [2021-12-17 21:08:12,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873749130] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:12,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299007628] [2021-12-17 21:08:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:12,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:12,508 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-17 21:08:12,509 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-17 21:08:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:12,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 21:08:12,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-17 21:08:12,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:12,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299007628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:12,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:12,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2021-12-17 21:08:12,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700541190] [2021-12-17 21:08:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:12,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:08:12,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:08:12,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:12,934 INFO L87 Difference]: Start difference. First operand 9227 states and 11352 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 21:08:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:13,225 INFO L93 Difference]: Finished difference Result 12943 states and 15971 transitions. [2021-12-17 21:08:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:08:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2021-12-17 21:08:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:13,244 INFO L225 Difference]: With dead ends: 12943 [2021-12-17 21:08:13,244 INFO L226 Difference]: Without dead ends: 5829 [2021-12-17 21:08:13,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-17 21:08:13,275 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 32 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1408 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-17 21:08:13,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1408 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2021-12-17 21:08:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 5489. [2021-12-17 21:08:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5489 states, 4425 states have (on average 1.2212429378531073) internal successors, (5404), 4500 states have internal predecessors, (5404), 545 states have call successors, (545), 371 states have call predecessors, (545), 517 states have return successors, (806), 618 states have call predecessors, (806), 543 states have call successors, (806) [2021-12-17 21:08:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5489 states to 5489 states and 6755 transitions. [2021-12-17 21:08:13,497 INFO L78 Accepts]: Start accepts. Automaton has 5489 states and 6755 transitions. Word has length 159 [2021-12-17 21:08:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:13,498 INFO L470 AbstractCegarLoop]: Abstraction has 5489 states and 6755 transitions. [2021-12-17 21:08:13,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 21:08:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5489 states and 6755 transitions. [2021-12-17 21:08:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 21:08:13,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:13,501 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2021-12-17 21:08:13,522 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-17 21:08:13,715 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,SelfDestructingSolverStorable26 [2021-12-17 21:08:13,715 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1649891671, now seen corresponding path program 1 times [2021-12-17 21:08:13,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:13,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044874015] [2021-12-17 21:08:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:13,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:08:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 21:08:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:08:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-17 21:08:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-17 21:08:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-17 21:08:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-17 21:08:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-17 21:08:13,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:13,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044874015] [2021-12-17 21:08:13,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044874015] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:13,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103668144] [2021-12-17 21:08:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:13,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:13,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:13,879 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-17 21:08:13,880 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-17 21:08:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:13,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:13,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-17 21:08:14,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:14,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103668144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:14,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:14,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-17 21:08:14,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541942793] [2021-12-17 21:08:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:14,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:14,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:14,166 INFO L87 Difference]: Start difference. First operand 5489 states and 6755 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 21:08:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:14,407 INFO L93 Difference]: Finished difference Result 9415 states and 11584 transitions. [2021-12-17 21:08:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2021-12-17 21:08:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:14,424 INFO L225 Difference]: With dead ends: 9415 [2021-12-17 21:08:14,424 INFO L226 Difference]: Without dead ends: 7401 [2021-12-17 21:08:14,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:14,428 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 61 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:14,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 603 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7401 states. [2021-12-17 21:08:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7401 to 7359. [2021-12-17 21:08:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7359 states, 5882 states have (on average 1.2169330159809588) internal successors, (7158), 5980 states have internal predecessors, (7158), 752 states have call successors, (752), 532 states have call predecessors, (752), 723 states have return successors, (1074), 847 states have call predecessors, (1074), 750 states have call successors, (1074) [2021-12-17 21:08:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7359 states to 7359 states and 8984 transitions. [2021-12-17 21:08:14,695 INFO L78 Accepts]: Start accepts. Automaton has 7359 states and 8984 transitions. Word has length 163 [2021-12-17 21:08:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:14,695 INFO L470 AbstractCegarLoop]: Abstraction has 7359 states and 8984 transitions. [2021-12-17 21:08:14,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-17 21:08:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 7359 states and 8984 transitions. [2021-12-17 21:08:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 21:08:14,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:14,699 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:14,718 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-17 21:08:14,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:14,916 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:14,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1793997160, now seen corresponding path program 1 times [2021-12-17 21:08:14,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:14,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979126982] [2021-12-17 21:08:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:14,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:08:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 21:08:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 21:08:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 21:08:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-17 21:08:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 21:08:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-17 21:08:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-17 21:08:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-17 21:08:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-12-17 21:08:14,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:14,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979126982] [2021-12-17 21:08:14,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979126982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:14,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:08:14,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:08:14,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241091694] [2021-12-17 21:08:14,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:14,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:08:14,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:14,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:08:14,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:08:14,998 INFO L87 Difference]: Start difference. First operand 7359 states and 8984 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-17 21:08:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:15,634 INFO L93 Difference]: Finished difference Result 10222 states and 12442 transitions. [2021-12-17 21:08:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:08:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 163 [2021-12-17 21:08:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:15,649 INFO L225 Difference]: With dead ends: 10222 [2021-12-17 21:08:15,650 INFO L226 Difference]: Without dead ends: 6872 [2021-12-17 21:08:15,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-12-17 21:08:15,656 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 864 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:15,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [873 Valid, 754 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:08:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6872 states. [2021-12-17 21:08:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6872 to 6588. [2021-12-17 21:08:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 5284 states have (on average 1.2081756245268735) internal successors, (6384), 5346 states have internal predecessors, (6384), 673 states have call successors, (673), 481 states have call predecessors, (673), 629 states have return successors, (916), 761 states have call predecessors, (916), 671 states have call successors, (916) [2021-12-17 21:08:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 7973 transitions. [2021-12-17 21:08:15,987 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 7973 transitions. Word has length 163 [2021-12-17 21:08:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:15,988 INFO L470 AbstractCegarLoop]: Abstraction has 6588 states and 7973 transitions. [2021-12-17 21:08:15,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-17 21:08:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 7973 transitions. [2021-12-17 21:08:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-17 21:08:15,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:15,991 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:15,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-17 21:08:15,991 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -335760307, now seen corresponding path program 1 times [2021-12-17 21:08:15,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:15,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004492820] [2021-12-17 21:08:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:15,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 21:08:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 21:08:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-17 21:08:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 21:08:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-17 21:08:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:08:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-17 21:08:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-17 21:08:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:08:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-17 21:08:16,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:16,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004492820] [2021-12-17 21:08:16,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004492820] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:16,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765311257] [2021-12-17 21:08:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:16,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:16,100 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-17 21:08:16,136 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-17 21:08:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:16,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 21:08:16,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-17 21:08:16,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:16,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765311257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:16,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:16,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2021-12-17 21:08:16,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836777833] [2021-12-17 21:08:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:16,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 21:08:16,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:16,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 21:08:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:16,383 INFO L87 Difference]: Start difference. First operand 6588 states and 7973 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 21:08:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:16,860 INFO L93 Difference]: Finished difference Result 8429 states and 10232 transitions. [2021-12-17 21:08:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 21:08:16,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2021-12-17 21:08:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:16,878 INFO L225 Difference]: With dead ends: 8429 [2021-12-17 21:08:16,879 INFO L226 Difference]: Without dead ends: 5991 [2021-12-17 21:08:16,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-17 21:08:16,886 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 290 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:16,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 369 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 21:08:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2021-12-17 21:08:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 5520. [2021-12-17 21:08:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5520 states, 4386 states have (on average 1.1958504331965345) internal successors, (5245), 4450 states have internal predecessors, (5245), 572 states have call successors, (572), 427 states have call predecessors, (572), 560 states have return successors, (779), 643 states have call predecessors, (779), 570 states have call successors, (779) [2021-12-17 21:08:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5520 states to 5520 states and 6596 transitions. [2021-12-17 21:08:17,184 INFO L78 Accepts]: Start accepts. Automaton has 5520 states and 6596 transitions. Word has length 164 [2021-12-17 21:08:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:17,185 INFO L470 AbstractCegarLoop]: Abstraction has 5520 states and 6596 transitions. [2021-12-17 21:08:17,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 21:08:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5520 states and 6596 transitions. [2021-12-17 21:08:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-17 21:08:17,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:17,188 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:08:17,205 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-17 21:08:17,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:17,405 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash -122202029, now seen corresponding path program 1 times [2021-12-17 21:08:17,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:17,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392267113] [2021-12-17 21:08:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:17,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 21:08:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 21:08:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 21:08:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 21:08:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:08:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:08:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:08:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-17 21:08:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:08:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-17 21:08:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-12-17 21:08:17,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:17,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392267113] [2021-12-17 21:08:17,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392267113] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:17,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224286450] [2021-12-17 21:08:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:17,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:17,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:17,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 21:08:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:17,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:17,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-17 21:08:17,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:17,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224286450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:17,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:17,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-17 21:08:17,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901427338] [2021-12-17 21:08:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:17,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:17,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:17,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:17,721 INFO L87 Difference]: Start difference. First operand 5520 states and 6596 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 21:08:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:17,882 INFO L93 Difference]: Finished difference Result 6056 states and 7233 transitions. [2021-12-17 21:08:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:17,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 175 [2021-12-17 21:08:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:17,911 INFO L225 Difference]: With dead ends: 6056 [2021-12-17 21:08:17,912 INFO L226 Difference]: Without dead ends: 3972 [2021-12-17 21:08:17,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:08:17,916 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 96 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:17,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 557 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2021-12-17 21:08:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3972. [2021-12-17 21:08:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3093 states have (on average 1.2159715486582605) internal successors, (3761), 3142 states have internal predecessors, (3761), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2021-12-17 21:08:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 4820 transitions. [2021-12-17 21:08:18,139 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 4820 transitions. Word has length 175 [2021-12-17 21:08:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:18,139 INFO L470 AbstractCegarLoop]: Abstraction has 3972 states and 4820 transitions. [2021-12-17 21:08:18,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 21:08:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 4820 transitions. [2021-12-17 21:08:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-17 21:08:18,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:18,142 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:18,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 21:08:18,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:18,359 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash 396134618, now seen corresponding path program 1 times [2021-12-17 21:08:18,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025731943] [2021-12-17 21:08:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:18,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:08:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 21:08:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 21:08:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 21:08:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-17 21:08:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:08:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 21:08:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-17 21:08:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-17 21:08:18,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:18,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025731943] [2021-12-17 21:08:18,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025731943] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:18,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9398295] [2021-12-17 21:08:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:18,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:18,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:18,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 21:08:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:18,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:18,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-17 21:08:18,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:18,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9398295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:18,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:18,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-17 21:08:18,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281915895] [2021-12-17 21:08:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:18,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:18,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:18,859 INFO L87 Difference]: Start difference. First operand 3972 states and 4820 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 21:08:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:19,157 INFO L93 Difference]: Finished difference Result 11892 states and 14428 transitions. [2021-12-17 21:08:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:19,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2021-12-17 21:08:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:19,176 INFO L225 Difference]: With dead ends: 11892 [2021-12-17 21:08:19,177 INFO L226 Difference]: Without dead ends: 7932 [2021-12-17 21:08:19,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:19,185 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 52 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:19,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 287 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2021-12-17 21:08:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7922. [2021-12-17 21:08:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7922 states, 6171 states have (on average 1.2092043428941825) internal successors, (7462), 6267 states have internal predecessors, (7462), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2021-12-17 21:08:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 9570 transitions. [2021-12-17 21:08:19,475 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 9570 transitions. Word has length 195 [2021-12-17 21:08:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:19,475 INFO L470 AbstractCegarLoop]: Abstraction has 7922 states and 9570 transitions. [2021-12-17 21:08:19,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 21:08:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 9570 transitions. [2021-12-17 21:08:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-17 21:08:19,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:08:19,478 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 21:08:19,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:19,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:19,688 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:08:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:08:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -501258660, now seen corresponding path program 1 times [2021-12-17 21:08:19,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:08:19,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256545409] [2021-12-17 21:08:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:19,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:08:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:08:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:08:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 21:08:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-17 21:08:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 21:08:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-17 21:08:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:08:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 21:08:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:08:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:08:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 21:08:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 21:08:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-17 21:08:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:08:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:08:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 21:08:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-17 21:08:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-17 21:08:19,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:08:19,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256545409] [2021-12-17 21:08:19,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256545409] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:08:19,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618690205] [2021-12-17 21:08:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:08:19,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:08:19,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:08:19,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 21:08:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:08:19,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:08:19,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:08:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-12-17 21:08:20,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:08:20,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618690205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:08:20,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:08:20,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-17 21:08:20,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973816268] [2021-12-17 21:08:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:08:20,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:08:20,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:08:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:08:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:20,180 INFO L87 Difference]: Start difference. First operand 7922 states and 9570 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-17 21:08:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:08:20,523 INFO L93 Difference]: Finished difference Result 14428 states and 17762 transitions. [2021-12-17 21:08:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:08:20,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2021-12-17 21:08:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:08:20,526 INFO L225 Difference]: With dead ends: 14428 [2021-12-17 21:08:20,527 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 21:08:20,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:08:20,554 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:08:20,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:08:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 21:08:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 21:08:20,555 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-17 21:08:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 21:08:20,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2021-12-17 21:08:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:08:20,558 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 21:08:20,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-17 21:08:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 21:08:20,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 21:08:20,566 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-17 21:08:20,567 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-17 21:08:20,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 21:08:20,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:08:20,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 21:09:04,657 WARN L227 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 160 DAG size of output: 159 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:09:53,135 WARN L227 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 163 DAG size of output: 162 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-17 21:11:07,382 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2021-12-17 21:11:07,383 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 915 925) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse10 (not (= ~m_pc~0 0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse2 (not (= ~token~0 ~local~0))) (.cse14 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse4)) (.cse3 (not (= ~t1_i~0 1))) (.cse15 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (= 0 |old(~m_st~0)|)) (.cse7 (not (= ~p_dw_st~0 0))) (.cse8 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse9 (not (= 0 ~q_req_up~0))) (.cse11 (not (= 2 ~M_E~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~c_dr_st~0 0)))) (and (or .cse0 (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~E_M~0 ~M_E~0)) .cse2 .cse3 (and .cse4 (= ~t1_st~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (= 1 ~E_1~0) .cse1 (not (<= ~token~0 (+ ~local~0 1))) .cse14 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 (= 0 ~E_1~0) .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13) (or (not (<= 1 ~t1_pc~0)) .cse0 .cse3 .cse6 .cse7 .cse1 .cse9 .cse10 .cse8 .cse14 .cse13) (or .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 (not (<= 2 ~E_M~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 (not (<= 2 |old(~t1_st~0)|)))))) [2021-12-17 21:11:07,384 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2021-12-17 21:11:07,384 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2021-12-17 21:11:07,384 INFO L854 garLoopResultBuilder]: At program point L57(lines 40 59) the Hoare annotation is: (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_st~0 0))) (.cse4 (not (= ~token~0 ~local~0))) (.cse14 (= 0 ~q_req_up~0)) (.cse7 (not (= ~t1_st~0 0))) (.cse5 (not (= ~c_dr_i~0 1))) (.cse12 (not (= ~c_dr_st~0 0))) (.cse8 (not (= 0 |old(~q_req_up~0)|))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (= ~m_pc~0 0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse10 (not (= 2 ~M_E~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse2 .cse9 .cse3 .cse6 .cse13 .cse14 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse9 .cse10 .cse11 .cse12) (or (not (= ~c_dr_pc~0 |old(~q_req_up~0)|)) (= 1 ~p_dw_pc~0) .cse2 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|)) .cse3 .cse5 .cse6 (not (= 2 |old(~q_read_ev~0)|)) (= 0 ~p_dw_st~0) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse8 .cse2 .cse9 .cse3 .cse6 .cse13 .cse10 .cse11))) [2021-12-17 21:11:07,385 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: (let ((.cse6 (not (= ~c_dr_i~0 1))) (.cse11 (not (= ~c_dr_st~0 0))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= ~m_pc~0 0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~E_1~0 ~M_E~0))) (.cse1 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse0 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse2 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse3 (= ~q_read_ev~0 |old(~q_read_ev~0)|)) (.cse9 (not (= 2 ~M_E~0))) (.cse10 (not (= ~T1_E~0 ~M_E~0)))) (and (or (not (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3) (not (= ~m_st~0 0)) .cse4 .cse5 (not (= ~token~0 ~local~0)) .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9 .cse10 .cse11) (or (not (= ~c_dr_pc~0 |old(~q_req_up~0)|)) (= 1 ~p_dw_pc~0) (and .cse0 (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0)) .cse4 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|)) .cse5 .cse6 .cse7 (not (= 2 |old(~q_read_ev~0)|)) (= 0 ~p_dw_st~0) (not (= 0 |old(~q_req_up~0)|)) .cse8 .cse9 .cse10 .cse11) (or .cse4 .cse8 .cse5 .cse7 (not (= ~c_dr_pc~0 1)) (and .cse1 .cse0 .cse2 .cse3) .cse9 .cse10))) [2021-12-17 21:11:07,385 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2021-12-17 21:11:07,385 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2021-12-17 21:11:07,385 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2021-12-17 21:11:07,385 INFO L858 garLoopResultBuilder]: For program point L266-1(lines 262 276) no Hoare annotation was computed. [2021-12-17 21:11:07,386 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2021-12-17 21:11:07,386 INFO L858 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2021-12-17 21:11:07,386 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 890 914) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse13 (= 1 ~E_1~0)) (.cse18 (= 0 ~E_1~0)) (.cse5 (and .cse20 (= ~t1_st~0 0))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse9 (not (= ~m_pc~0 0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse2 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse3 (not (= ~token~0 ~local~0))) (.cse14 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse20)) (.cse4 (not (= ~t1_i~0 1))) (.cse15 (not (= ~t1_pc~0 1))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (= 0 |old(~m_st~0)|)) (.cse6 (not (= ~p_dw_st~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse8 (not (= 0 ~q_req_up~0))) (.cse10 (not (= 2 ~M_E~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~c_dr_st~0 0))) (.cse19 (not (<= 2 |old(~t1_st~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= ~E_M~0 ~M_E~0)) (not (<= ~t1_pc~0 0)) .cse3 (not (= ~E_1~0 ~M_E~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse2 .cse14 .cse4 .cse15 .cse16 .cse17 .cse6 .cse7 .cse8 .cse18 .cse12 .cse19) (or .cse0 .cse13 .cse2 (not (<= ~token~0 (+ ~local~0 1))) .cse14 .cse4 .cse15 .cse17 .cse6 .cse7 .cse8 .cse18 .cse10 (not (< ~local~0 ~token~0)) .cse11 .cse12) (or (not (<= 1 ~t1_pc~0)) .cse0 .cse4 .cse17 .cse6 .cse2 .cse8 .cse9 .cse7 .cse14 .cse12) (or .cse0 .cse4 .cse5 .cse17 .cse1 .cse6 .cse2 .cse8 .cse9 .cse7 .cse12) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse15 .cse16 (not (= ~E_1~0 1)) .cse17 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19)))) [2021-12-17 21:11:07,386 INFO L854 garLoopResultBuilder]: At program point L733(lines 721 735) the Hoare annotation is: (let ((.cse28 (= ~T1_E~0 ~M_E~0)) (.cse27 (= 2 ~M_E~0)) (.cse33 (= 0 ~q_req_up~0)) (.cse32 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse31 (= ~t1_i~0 1)) (.cse30 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse26 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse5 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse6 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse19 (not (= ~token~0 ~local~0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse20 (and .cse3 .cse5 .cse6 (= ~t1_st~0 0))) (.cse21 (not (= ~m_pc~0 0))) (.cse4 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (not .cse26)) (.cse29 (= ~m_st~0 0)) (.cse1 (= 1 ~E_1~0)) (.cse2 (not .cse30)) (.cse7 (not .cse31)) (.cse8 (not (= ~t1_pc~0 1))) (.cse10 (= 0 |old(~m_st~0)|)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse12 (not .cse32)) (.cse13 (not .cse33)) (.cse24 (<= 1 ~t1_pc~0)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= 0 ~E_1~0)) (.cse22 (not .cse27)) (.cse23 (not .cse28)) (.cse15 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse2 (not (= ~E_M~0 ~M_E~0)) .cse18 .cse19 (not (= ~E_1~0 ~M_E~0)) .cse20 .cse7 .cse11 .cse12 .cse13 .cse21 .cse22 .cse23 .cse15) (or .cse0 .cse2 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse6) .cse19 .cse7 .cse8 .cse9 (not (= ~E_1~0 1)) .cse10 .cse11 .cse12 .cse13 (and .cse24 .cse25 .cse26 .cse29 .cse27 .cse28) .cse22 .cse23 .cse15 .cse16) (or .cse0 .cse7 .cse10 .cse17 .cse11 .cse2 .cse13 .cse21 .cse12 .cse18 .cse20 .cse15) (or (not .cse24) .cse0 .cse7 .cse10 .cse11 .cse2 .cse13 .cse21 .cse12 (and .cse4 .cse6) .cse15) (or .cse0 (and .cse24 .cse30 .cse25 .cse26 .cse29 .cse27 .cse28 .cse31 .cse3 .cse5 .cse32 .cse33) .cse1 .cse2 (not (<= ~token~0 (+ ~local~0 1))) .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (and .cse24 .cse30 .cse25 .cse26 .cse27 .cse28 .cse31 .cse3 .cse5 .cse6 .cse32 .cse33) .cse14 .cse22 (not (< ~local~0 ~token~0)) .cse23 .cse15)))) [2021-12-17 21:11:07,387 INFO L858 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2021-12-17 21:11:07,387 INFO L854 garLoopResultBuilder]: At program point L715(lines 699 717) the Hoare annotation is: (let ((.cse15 (<= 0 |activate_threads2_is_master_triggered_#res#1|)) (.cse16 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse17 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse24 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (<= |activate_threads2_is_master_triggered_#res#1| 0))) (let ((.cse5 (not (<= 2 ~E_M~0))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse2 (not (= ~token~0 ~local~0))) (.cse21 (not (= ~m_pc~0 0))) (.cse11 (and .cse15 .cse16 .cse17 .cse24 .cse18 .cse19)) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse22 (= 1 ~E_1~0)) (.cse1 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (= 0 |old(~m_st~0)|)) (.cse7 (not (= ~p_dw_st~0 0))) (.cse8 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse9 (not (= 0 ~q_req_up~0))) (.cse23 (= 0 ~E_1~0)) (.cse10 (not (= 2 ~M_E~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~E_1~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse3 (and .cse15 .cse16 .cse17 .cse18 .cse19 (= ~t1_st~0 0)) .cse6 .cse20 .cse7 .cse1 .cse9 .cse21 .cse8 .cse13) (or (not (<= 1 ~t1_pc~0)) .cse0 .cse3 .cse6 .cse7 .cse1 .cse9 .cse21 .cse8 .cse11 .cse13) (or .cse0 .cse22 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse11 .cse13 .cse14) (or .cse0 .cse20 .cse1 (not (= ~E_M~0 ~M_E~0)) (not (<= ~t1_pc~0 0)) .cse2 (not (= ~E_1~0 ~M_E~0)) .cse3 .cse7 .cse8 .cse9 .cse21 .cse11 .cse10 .cse12 .cse13) (or .cse0 .cse22 .cse1 (not (<= ~token~0 (+ ~local~0 1))) (and .cse24 .cse18) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 (not (< ~local~0 ~token~0)) .cse12 .cse13)))) [2021-12-17 21:11:07,387 INFO L858 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2021-12-17 21:11:07,387 INFO L854 garLoopResultBuilder]: At program point L734(lines 718 736) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~T1_E~0 ~M_E~0)) (.cse6 (= 2 ~M_E~0)) (.cse5 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse8 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse9 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse10 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse11 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse25 (and .cse5 .cse8 .cse9 .cse10 .cse11 (= ~t1_st~0 0))) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse28 (not (<= ~t1_pc~0 0))) (.cse1 (= 1 ~E_1~0)) (.cse20 (= 0 ~E_1~0)) (.cse29 (not (= ~token~0 ~local~0))) (.cse22 (= ~m_st~0 0)) (.cse15 (not (= ~t1_pc~0 1))) (.cse30 (not (<= 2 ~E_M~0))) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (not .cse6)) (.cse23 (not .cse7)) (.cse31 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (<= 1 ~t1_pc~0)) (.cse0 (not .cse4)) (.cse14 (not (= ~t1_i~0 1))) (.cse16 (= 0 |old(~m_st~0)|)) (.cse17 (not (= ~p_dw_st~0 0))) (.cse13 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse19 (not (= 0 ~q_req_up~0))) (.cse27 (not (= ~m_pc~0 0))) (.cse18 (not .cse12)) (.cse24 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 (not (<= ~token~0 (+ ~local~0 1))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (not (< ~local~0 ~token~0)) .cse23 .cse24) (or .cse0 .cse14 .cse25 .cse16 .cse26 .cse17 .cse13 .cse19 .cse27 .cse18 .cse28 .cse24) (or .cse25 .cse0 .cse26 .cse13 (not (= ~E_M~0 ~M_E~0)) .cse28 .cse29 (not (= ~E_1~0 ~M_E~0)) .cse14 .cse17 .cse18 .cse19 .cse27 .cse21 .cse23 .cse24) (or .cse0 .cse1 .cse13 .cse14 (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse10) .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse31) (or .cse0 .cse13 .cse29 .cse14 (and .cse3 .cse22) .cse15 .cse30 (not (= ~E_1~0 1)) .cse16 .cse17 .cse18 .cse19 (and .cse3 .cse11) .cse21 .cse23 .cse24 .cse31) (or (not .cse2) .cse0 .cse14 .cse16 .cse17 .cse13 .cse19 .cse27 .cse18 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse11) .cse24)))) [2021-12-17 21:11:07,388 INFO L858 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2021-12-17 21:11:07,388 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2021-12-17 21:11:07,388 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2021-12-17 21:11:07,388 INFO L858 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2021-12-17 21:11:07,388 INFO L854 garLoopResultBuilder]: At program point L714(lines 702 716) the Hoare annotation is: (let ((.cse22 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse23 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse20 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse21 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse8 (and .cse22 .cse23 .cse20 .cse21)) (.cse16 (not (= ~token~0 ~local~0))) (.cse12 (not (<= 2 ~E_M~0))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 ~E_1~0)) (.cse11 (not (= ~t1_pc~0 1))) (.cse13 (= 0 ~E_1~0)) (.cse18 (not (= 2 ~M_E~0))) (.cse19 (not (= ~T1_E~0 ~M_E~0))) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (= ~t1_i~0 1))) (.cse2 (= 0 |old(~m_st~0)|)) (.cse15 (not (= |old(~t1_st~0)| 0))) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse5 (not (= 0 ~q_req_up~0))) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse17 (and .cse22 .cse23 .cse21 (= ~t1_st~0 0))) (.cse9 (not (= ~c_dr_st~0 0)))) (and (or (not (<= 1 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse4 .cse8 .cse1 .cse11 .cse12 .cse2 .cse3 .cse7 .cse5 .cse13 .cse9 .cse14) (or .cse0 .cse15 .cse4 (not (= ~E_M~0 ~M_E~0)) (not (<= ~t1_pc~0 0)) .cse16 (not (= ~E_1~0 ~M_E~0)) .cse1 .cse3 .cse7 .cse5 .cse6 .cse17 .cse18 .cse19 .cse9) (or .cse0 .cse4 .cse8 .cse16 .cse1 .cse11 .cse12 (not (= ~E_1~0 1)) .cse2 .cse3 .cse7 .cse5 .cse18 .cse19 .cse9 .cse14) (or .cse0 .cse10 .cse4 (not (<= ~token~0 (+ ~local~0 1))) (and .cse20 .cse21) .cse1 .cse11 .cse2 .cse3 .cse7 .cse5 .cse13 .cse18 (not (< ~local~0 ~token~0)) .cse19 .cse9) (or .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9)))) [2021-12-17 21:11:07,388 INFO L858 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2021-12-17 21:11:07,388 INFO L858 garLoopResultBuilder]: For program point L906-2(lines 890 914) no Hoare annotation was computed. [2021-12-17 21:11:07,389 INFO L858 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2021-12-17 21:11:07,389 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 |old(~p_dw_st~0)|))) (let ((.cse2 (not (= ~c_dr_i~0 1))) (.cse4 (and .cse9 (= ~c_dr_st~0 0))) (.cse6 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= ~m_pc~0 0))) (.cse1 (not (<= ~t1_pc~0 0))) (.cse3 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= 2 ~M_E~0))) (.cse8 (not (= ~T1_E~0 ~M_E~0)))) (and (or (not (= ~q_write_ev~0 ~q_read_ev~0)) (= 1 ~p_dw_pc~0) .cse0 .cse1 .cse2 .cse3 (not (= 2 ~q_read_ev~0)) .cse4 (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse5 (= 0 |old(~p_dw_st~0)|) .cse6 .cse7 .cse8) (or (not (<= ~c_dr_pc~0 0)) (not (= ~m_st~0 0)) .cse0 .cse1 (not (= ~token~0 ~local~0)) .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse5 .cse1 (and .cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) .cse3 (not (= ~c_dr_pc~0 1)) .cse7 .cse8)))) [2021-12-17 21:11:07,389 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2021-12-17 21:11:07,390 INFO L858 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2021-12-17 21:11:07,390 INFO L858 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2021-12-17 21:11:07,390 INFO L858 garLoopResultBuilder]: For program point L403-2(lines 387 411) no Hoare annotation was computed. [2021-12-17 21:11:07,390 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2021-12-17 21:11:07,390 INFO L854 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 |old(~p_dw_st~0)|))) (let ((.cse2 (not (= ~c_dr_i~0 1))) (.cse4 (and .cse9 (= ~c_dr_st~0 0))) (.cse6 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (not (= ~E_M~0 ~M_E~0))) (.cse5 (not (= ~m_pc~0 0))) (.cse1 (not (<= ~t1_pc~0 0))) (.cse3 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= 2 ~M_E~0))) (.cse8 (not (= ~T1_E~0 ~M_E~0)))) (and (or (not (= ~q_write_ev~0 ~q_read_ev~0)) (= 1 ~p_dw_pc~0) .cse0 .cse1 .cse2 .cse3 (not (= 2 ~q_read_ev~0)) .cse4 (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse5 (= 0 |old(~p_dw_st~0)|) .cse6 .cse7 .cse8) (or (not (<= ~c_dr_pc~0 0)) (not (= ~m_st~0 0)) .cse0 .cse1 (not (= ~token~0 ~local~0)) .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse5 .cse1 (and .cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) .cse3 (not (= ~c_dr_pc~0 1)) .cse7 .cse8)))) [2021-12-17 21:11:07,390 INFO L854 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse11 (= 0 |old(~p_dw_st~0)|)) (.cse15 (not (<= ~c_dr_pc~0 0))) (.cse4 (= ~c_dr_st~0 0)) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~c_dr_i~0 1))) (.cse18 (not (= ~t1_st~0 0))) (.cse12 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (= 1 ~p_dw_pc~0)) (.cse1 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse2 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse3 (<= activate_threads1_~tmp~1 0)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~E_1~0 ~M_E~0))) (.cse13 (not (= 2 ~M_E~0))) (.cse9 (not (= 2 ~q_read_ev~0))) (.cse14 (not (= ~T1_E~0 ~M_E~0)))) (and (or (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse16 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 (and .cse1 .cse2 .cse3) .cse18 .cse10 .cse12 .cse13 .cse14) (or (not (= ~p_dw_pc~0 1)) (not (= 0 ~p_dw_st~0)) .cse15 .cse16 .cse5 .cse6 .cse17 .cse7 .cse8 .cse18 .cse10 (not (<= 2 ~fast_clk_edge~0)) .cse11 .cse12 .cse13 .cse14) (or .cse15 (and (= ~p_dw_st~0 0) .cse4) .cse16 .cse5 .cse6 .cse17 .cse7 .cse8 .cse18 .cse10 (and .cse1 .cse19) .cse12 .cse13 .cse14) (or .cse0 (and .cse1 .cse2 .cse19 .cse3) .cse5 .cse10 .cse6 .cse8 (not (= ~c_dr_pc~0 1)) .cse13 .cse9 .cse14))) [2021-12-17 21:11:07,390 INFO L858 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2021-12-17 21:11:07,391 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2021-12-17 21:11:07,391 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2021-12-17 21:11:07,391 INFO L858 garLoopResultBuilder]: For program point L853-1(lines 834 861) no Hoare annotation was computed. [2021-12-17 21:11:07,391 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 834 861) the Hoare annotation is: (let ((.cse11 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~T1_E~0 |old(~T1_E~0)|))) (let ((.cse6 (= 0 ~m_st~0)) (.cse8 (and .cse11 (= ~M_E~0 |old(~M_E~0)|) .cse12 .cse13)) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse10 (not (= ~t1_st~0 0))) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse5 (not (= 0 ~q_req_up~0))) (.cse9 (not (= ~m_pc~0 0))) (.cse7 (not (= ~c_dr_st~0 0)))) (and (or .cse0 (= 0 |old(~E_1~0)|) .cse1 .cse2 (not (= ~t1_pc~0 1)) .cse3 .cse4 .cse5 .cse6 (not (<= 2 |old(~E_M~0)|)) (not (<= 2 ~t1_st~0)) (= 1 |old(~E_1~0)|) .cse7 .cse8) (or (not (<= 1 ~t1_pc~0)) .cse0 .cse2 .cse3 .cse1 .cse5 .cse9 .cse4 .cse6 .cse8 .cse7) (or .cse0 .cse2 .cse10 .cse3 .cse1 .cse5 .cse9 .cse4 .cse6 .cse8 .cse7) (or .cse0 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) .cse1 (not (= 2 |old(~M_E~0)|)) (not (<= ~t1_pc~0 0)) (and .cse11 .cse12 .cse13 (= ~E_1~0 ~M_E~0)) (not (= ~token~0 ~local~0)) .cse2 (not (= |old(~E_1~0)| |old(~M_E~0)|)) .cse10 .cse3 .cse4 .cse5 .cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse7)))) [2021-12-17 21:11:07,391 INFO L858 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2021-12-17 21:11:07,391 INFO L858 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2021-12-17 21:11:07,392 INFO L858 garLoopResultBuilder]: For program point L838-1(lines 837 860) no Hoare annotation was computed. [2021-12-17 21:11:07,392 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2021-12-17 21:11:07,392 INFO L854 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: (let ((.cse4 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|))) (.cse0 (not (= ~E_M~0 ~M_E~0))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~c_dr_i~0 1))) (.cse3 (not (= ~E_1~0 ~M_E~0))) (.cse1 (not (= ~m_pc~0 0))) (.cse5 (not (= 2 ~M_E~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_dr_pc~0 1)) .cse4 .cse5 .cse6) (or (not (<= ~c_dr_pc~0 0)) (not (= ~m_st~0 0)) .cse0 .cse2 (not (= ~token~0 ~local~0)) .cse7 .cse3 (not (= ~t1_st~0 0)) .cse1 .cse4 .cse5 .cse6 .cse8) (or (= 1 ~p_dw_pc~0) (and (= ~q_write_ev~0 ~q_read_ev~0) (= 2 ~q_read_ev~0)) .cse0 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|)) .cse2 .cse7 .cse3 (not (= 2 |old(~q_read_ev~0)|)) (= 0 ~p_dw_st~0) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse1 .cse5 .cse6 .cse8))) [2021-12-17 21:11:07,392 INFO L858 garLoopResultBuilder]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2021-12-17 21:11:07,392 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2021-12-17 21:11:07,393 INFO L858 garLoopResultBuilder]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2021-12-17 21:11:07,393 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2021-12-17 21:11:07,393 INFO L854 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 ~M_E~0))) (.cse1 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~E_1~0 ~M_E~0))) (.cse3 (not (= ~c_dr_i~0 1))) (.cse4 (not (= ~m_pc~0 0))) (.cse5 (not (= 2 ~M_E~0))) (.cse6 (and (<= 0 is_do_read_c_triggered_~__retres1~1) (<= is_do_read_c_triggered_~__retres1~1 0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~c_dr_st~0 0)))) (and (or (not (= ~q_write_ev~0 ~q_read_ev~0)) (= 1 ~p_dw_pc~0) .cse0 .cse1 .cse2 .cse3 (not (= 2 ~q_read_ev~0)) (= 0 ~p_dw_st~0) (not (= 0 ~q_req_up~0)) .cse4 (not (= ~c_dr_pc~0 ~q_req_up~0)) .cse5 .cse6 .cse7 .cse8) (or (not (<= ~c_dr_pc~0 0)) (not (= ~m_st~0 0)) .cse0 .cse1 .cse2 (not (= ~token~0 ~local~0)) .cse3 (not (= ~t1_st~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-12-17 21:11:07,393 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-12-17 21:11:07,393 INFO L858 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2021-12-17 21:11:07,394 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 99 127) no Hoare annotation was computed. [2021-12-17 21:11:07,394 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2021-12-17 21:11:07,394 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2021-12-17 21:11:07,394 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2021-12-17 21:11:07,394 INFO L858 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2021-12-17 21:11:07,395 INFO L858 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2021-12-17 21:11:07,396 INFO L854 garLoopResultBuilder]: At program point L828(lines 783 833) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,396 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-12-17 21:11:07,396 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2021-12-17 21:11:07,396 INFO L861 garLoopResultBuilder]: At program point L1060(lines 1051 1062) the Hoare annotation is: true [2021-12-17 21:11:07,396 INFO L854 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,396 INFO L858 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2021-12-17 21:11:07,396 INFO L858 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2021-12-17 21:11:07,396 INFO L854 garLoopResultBuilder]: At program point L600(lines 595 602) the Hoare annotation is: false [2021-12-17 21:11:07,397 INFO L858 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2021-12-17 21:11:07,397 INFO L854 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,397 INFO L858 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2021-12-17 21:11:07,397 INFO L858 garLoopResultBuilder]: For program point L799(lines 789 827) no Hoare annotation was computed. [2021-12-17 21:11:07,397 INFO L858 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2021-12-17 21:11:07,397 INFO L854 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse8 (not (= 1 ~p_dw_pc~0))) (.cse14 (= ~c_dr_pc~0 1)) (.cse0 (= ~token~0 ~local~0)) (.cse1 (<= ~c_dr_pc~0 0)) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse3 (= 2 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (= ~T1_E~0 ~M_E~0)) (.cse6 (= ~E_1~0 ~M_E~0)) (.cse7 (= ~c_dr_st~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (= ~c_dr_i~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~E_M~0 ~M_E~0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse9 .cse3 .cse5 .cse14 (= ~c_dr_pc~0 ~q_req_up~0) .cse6 .cse12 .cse13) (and .cse8 .cse9 .cse3 .cse5 .cse14 .cse6 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_pc~0 ~q_req_up~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-17 21:11:07,405 INFO L854 garLoopResultBuilder]: At program point L932(lines 926 934) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,405 INFO L858 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2021-12-17 21:11:07,405 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2021-12-17 21:11:07,405 INFO L858 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2021-12-17 21:11:07,405 INFO L854 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (= 2 ~M_E~0) [2021-12-17 21:11:07,406 INFO L854 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,406 INFO L858 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2021-12-17 21:11:07,406 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2021-12-17 21:11:07,406 INFO L854 garLoopResultBuilder]: At program point L1000(line 1000) the Hoare annotation is: (and (= ~token~0 ~local~0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~p_dw_st~0 0) (= ~E_1~0 ~M_E~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 21:11:07,406 INFO L858 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2021-12-17 21:11:07,406 INFO L858 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2021-12-17 21:11:07,406 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2021-12-17 21:11:07,406 INFO L854 garLoopResultBuilder]: At program point L571(lines 562 573) the Hoare annotation is: (= 2 ~M_E~0) [2021-12-17 21:11:07,406 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2021-12-17 21:11:07,407 INFO L858 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2021-12-17 21:11:07,407 INFO L854 garLoopResultBuilder]: At program point L671(lines 666 697) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (= ~token~0 ~local~0) (<= 2 ~E_M~0) .cse0 (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (not (= 1 ~E_1~0)) (= ~t1_pc~0 1)) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~m_pc~0 0) .cse3))) [2021-12-17 21:11:07,407 INFO L858 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2021-12-17 21:11:07,407 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2021-12-17 21:11:07,407 INFO L854 garLoopResultBuilder]: At program point L1002(line 1002) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~E_1~0 ~M_E~0)) (.cse5 (= 0 ~q_req_up~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~E_M~0 ~M_E~0)) (.cse13 (= ~m_pc~0 0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ~m_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-17 21:11:07,408 INFO L854 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= 0 ~q_req_up~0)) (.cse5 (= ~c_dr_st~0 0)) (.cse6 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse7 (<= ~t1_pc~0 0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_pc~0 0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 (= ~E_1~0 ~M_E~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-12-17 21:11:07,408 INFO L854 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,408 INFO L858 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2021-12-17 21:11:07,408 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-12-17 21:11:07,408 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2021-12-17 21:11:07,408 INFO L854 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= 0 ~q_req_up~0)) (.cse5 (= ~c_dr_st~0 0)) (.cse6 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse7 (<= ~t1_pc~0 0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_pc~0 0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 (= ~E_1~0 ~M_E~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-12-17 21:11:07,408 INFO L854 garLoopResultBuilder]: At program point L970(lines 963 972) the Hoare annotation is: (and (= ~token~0 ~local~0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~p_dw_st~0 0) (= ~E_1~0 ~M_E~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 21:11:07,409 INFO L854 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= 0 ~q_req_up~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse8 (not (= 0 ~m_st~0))) (.cse9 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse10 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse12 (= ~E_1~0 1))) (or (and .cse0 (<= 2 ~E_M~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0) .cse12))) [2021-12-17 21:11:07,409 INFO L858 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2021-12-17 21:11:07,409 INFO L854 garLoopResultBuilder]: At program point L211(lines 206 260) the Hoare annotation is: false [2021-12-17 21:11:07,409 INFO L854 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,409 INFO L854 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_dr_pc~0 1)) (.cse8 (= ~token~0 ~local~0)) (.cse9 (<= ~c_dr_pc~0 0)) (.cse10 (not (= 0 ~p_dw_st~0))) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse11 (= ~m_st~0 0)) (.cse5 (= ~E_1~0 ~M_E~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse15 (not (= 1 ~p_dw_pc~0))) (.cse0 (<= ~t1_pc~0 0)) (.cse13 (= ~c_dr_i~0 1)) (.cse14 (= ~t1_st~0 0)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse1 .cse2 .cse11 .cse5 .cse12 .cse0 .cse3 .cse13 .cse14 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse1 .cse2 .cse11 .cse5 .cse12 .cse15 .cse0 .cse13 .cse14 .cse6 .cse7))) [2021-12-17 21:11:07,410 INFO L858 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2021-12-17 21:11:07,410 INFO L858 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2021-12-17 21:11:07,410 INFO L854 garLoopResultBuilder]: At program point L378-1(lines 369 386) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,410 INFO L858 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-12-17 21:11:07,410 INFO L854 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,410 INFO L854 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,410 INFO L854 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2021-12-17 21:11:07,411 INFO L854 garLoopResultBuilder]: At program point L1007-1(lines 1004 1044) the Hoare annotation is: (let ((.cse6 (not (= 0 ~E_1~0))) (.cse8 (not (= 1 ~E_1~0))) (.cse9 (= ~t1_st~0 0)) (.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse11 (not (= 0 ~m_st~0))) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse10 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (= ~token~0 ~local~0) (= ~T1_E~0 ~M_E~0) .cse0 (= 2 ~M_E~0) .cse1 .cse2 .cse3 .cse4 (<= ~t1_pc~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 (= ~E_M~0 ~M_E~0) .cse10) (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 (= ~t1_pc~0 1) .cse8 (<= 2 ~t1_st~0)) (and .cse4 .cse11 .cse5 .cse0 .cse7 .cse1 .cse2 .cse9 .cse10 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse11 .cse5 .cse0 .cse7 .cse1 .cse2 .cse10 .cse3))) [2021-12-17 21:11:07,411 INFO L854 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,411 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2021-12-17 21:11:07,411 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2021-12-17 21:11:07,411 INFO L858 garLoopResultBuilder]: For program point L1008(line 1008) no Hoare annotation was computed. [2021-12-17 21:11:07,411 INFO L854 garLoopResultBuilder]: At program point L678-1(lines 666 697) the Hoare annotation is: (let ((.cse1 (not (= 0 ~m_st~0))) (.cse9 (<= 2 ~E_M~0)) (.cse15 (= ~t1_pc~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse3 (= ~t1_i~0 1)) (.cse10 (= 2 ~M_E~0)) (.cse11 (= ~T1_E~0 ~M_E~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= 0 ~q_req_up~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse0 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse13 (not (= 0 ~E_1~0))) (.cse4 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse14 (not (= 1 ~E_1~0))) (.cse17 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8 .cse0 .cse12 .cse2 .cse13 .cse4 .cse14 .cse15 .cse7) (and .cse16 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8 .cse0 .cse1 .cse2 .cse12 .cse13 .cse4 .cse14 .cse17) (and .cse9 .cse3 .cse11 .cse10 .cse5 .cse6 .cse8 .cse0 .cse1 .cse2 .cse13 .cse14 .cse15 .cse4) (and (<= ~token~0 (+ ~local~0 1)) .cse9 .cse3 .cse11 .cse10 (< ~local~0 ~token~0) .cse5 .cse6 .cse8 .cse0 .cse2 .cse13 .cse14 .cse15 .cse4) (and .cse16 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8 .cse0 .cse2 .cse12 .cse13 .cse4 .cse14 .cse17 .cse7))) [2021-12-17 21:11:07,411 INFO L854 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,412 INFO L854 garLoopResultBuilder]: At program point L480(lines 469 482) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,412 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2021-12-17 21:11:07,412 INFO L858 garLoopResultBuilder]: For program point L679(line 679) no Hoare annotation was computed. [2021-12-17 21:11:07,412 INFO L854 garLoopResultBuilder]: At program point L481(lines 465 483) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,412 INFO L858 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2021-12-17 21:11:07,412 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 21:11:07,412 INFO L854 garLoopResultBuilder]: At program point L813(lines 789 827) the Hoare annotation is: (let ((.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t1_pc~0 0)) (.cse8 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse19 (= ~E_M~0 ~M_E~0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= 2 ~M_E~0)) (.cse10 (not (= 0 ~E_1~0))) (.cse12 (= ~t1_pc~0 1)) (.cse13 (not (= 1 ~E_1~0))) (.cse15 (<= 2 ~t1_st~0)) (.cse18 (= ~t1_st~0 0)) (.cse7 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse20 (not (= 0 ~m_st~0))) (.cse9 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse1 (= ~t1_i~0 1)) (.cse11 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= 0 ~q_req_up~0)) (.cse14 (= ~m_pc~0 0)) (.cse6 (= ~c_dr_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse3 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse13 .cse18 .cse19 .cse14) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse16 .cse3 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse17 .cse20 .cse9 .cse8 .cse10 .cse11 .cse13 .cse18 .cse19) (and (<= ~token~0 (+ ~local~0 1)) .cse0 .cse1 .cse2 .cse3 (< ~local~0 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse7 .cse20 .cse9 .cse1 .cse11 .cse4 .cse5 .cse18 .cse14 .cse6) (and (<= 1 ~t1_pc~0) .cse7 .cse20 .cse9 .cse1 .cse11 .cse4 .cse5 .cse14 .cse6))) [2021-12-17 21:11:07,412 INFO L854 garLoopResultBuilder]: At program point L648-1(lines 622 661) the Hoare annotation is: (let ((.cse2 (= 2 ~M_E~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= 0 ~q_req_up~0)) (.cse5 (= ~c_dr_st~0 0)) (.cse6 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse7 (not (= 0 ~m_st~0))) (.cse9 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (not (= 0 ~E_1~0))) (.cse11 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse12 (not (= 1 ~E_1~0)))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) (and (<= 2 ~E_M~0) .cse2 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse11 .cse12 (= ~t1_pc~0 1) (<= 2 ~t1_st~0)))) [2021-12-17 21:11:07,413 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2021-12-17 21:11:07,413 INFO L854 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2021-12-17 21:11:07,413 INFO L858 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2021-12-17 21:11:07,413 INFO L854 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (and (<= ~t1_pc~0 0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 21:11:07,413 INFO L861 garLoopResultBuilder]: At program point L1045(lines 992 1050) the Hoare annotation is: true [2021-12-17 21:11:07,413 INFO L854 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,413 INFO L858 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2021-12-17 21:11:07,413 INFO L854 garLoopResultBuilder]: At program point L286-1(lines 277 294) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~E_1~0 ~M_E~0)) (.cse3 (= 0 ~q_req_up~0)) (.cse4 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~c_dr_i~0 1)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (= 2 ~q_read_ev~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_pc~0 0))) (or (and (not (= 0 ~p_dw_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~token~0 ~local~0) .cse0 .cse1 (= ~m_st~0 0) (<= 2 ~fast_clk_edge~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~slow_clk_edge~0) .cse8 .cse9 .cse10 (= ~t1_st~0 0) .cse11 .cse12))) [2021-12-17 21:11:07,414 INFO L858 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2021-12-17 21:11:07,414 INFO L858 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2021-12-17 21:11:07,414 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2021-12-17 21:11:07,414 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2021-12-17 21:11:07,414 INFO L854 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,414 INFO L858 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2021-12-17 21:11:07,414 INFO L858 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2021-12-17 21:11:07,414 INFO L854 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,414 INFO L858 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2021-12-17 21:11:07,415 INFO L858 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2021-12-17 21:11:07,415 INFO L858 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-12-17 21:11:07,415 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 21:11:07,415 INFO L854 garLoopResultBuilder]: At program point L256(lines 203 261) the Hoare annotation is: (and (<= ~t1_pc~0 0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~c_dr_pc~0 1) (= ~E_1~0 ~M_E~0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 21:11:07,415 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2021-12-17 21:11:07,415 INFO L854 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,415 INFO L858 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2021-12-17 21:11:07,415 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-12-17 21:11:07,415 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2021-12-17 21:11:07,416 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2021-12-17 21:11:07,416 INFO L854 garLoopResultBuilder]: At program point L357-2(lines 353 368) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,416 INFO L854 garLoopResultBuilder]: At program point L754-1(lines 745 762) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~E_1~0 ~M_E~0)) (.cse5 (= 0 ~q_req_up~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~E_M~0 ~M_E~0)) (.cse13 (= ~m_pc~0 0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ~m_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-17 21:11:07,416 INFO L854 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= ~token~0 (+ ~local~0 1)) .cse0 (= ~T1_E~0 ~M_E~0) (= 2 ~M_E~0) (< ~local~0 ~token~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0))) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~m_pc~0 0) .cse3))) [2021-12-17 21:11:07,416 INFO L858 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2021-12-17 21:11:07,416 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 236) no Hoare annotation was computed. [2021-12-17 21:11:07,417 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2021-12-17 21:11:07,417 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 21:11:07,417 INFO L854 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,417 INFO L854 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,417 INFO L854 garLoopResultBuilder]: At program point L656(lines 619 662) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~E_M~0)) (.cse1 (= 2 ~M_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= 0 ~q_req_up~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse9 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse11 (not (= 0 ~E_1~0))) (.cse12 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (= ~t1_pc~0 1)) (.cse13 (not (= 1 ~E_1~0))) (.cse14 (= ~t1_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~E_M~0 ~M_E~0)) (and .cse0 .cse15 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse16 .cse13 (<= 2 ~t1_st~0)) (and .cse0 .cse15 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse16 .cse13 .cse14))) [2021-12-17 21:11:07,417 INFO L858 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2021-12-17 21:11:07,417 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~E_1~0 ~M_E~0)) (.cse0 (<= ~t1_pc~0 0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 1) .cse4 .cse5 .cse6) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) (not (= 0 ~p_dw_st~0)) .cse1 .cse2 (= ~m_st~0 0) .cse4 (= ~c_dr_st~0 0) .cse0 .cse3 (= ~c_dr_i~0 1) (= ~t1_st~0 0) .cse5 .cse6))) [2021-12-17 21:11:07,418 INFO L854 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,418 INFO L854 garLoopResultBuilder]: At program point L954-1(lines 935 962) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,418 INFO L854 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~token~0 ~local~0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~m_st~0 0) (<= 2 ~fast_clk_edge~0) (= ~p_dw_st~0 0) (= ~E_1~0 ~M_E~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (<= 2 ~slow_clk_edge~0) (= ~c_dr_i~0 1) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 21:11:07,418 INFO L858 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2021-12-17 21:11:07,418 INFO L854 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse7 (= ~c_dr_i~0 1)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse6 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse7 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse7 .cse3 (= ~t1_st~0 0) .cse4 .cse6 .cse5))) [2021-12-17 21:11:07,418 INFO L854 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,418 INFO L854 garLoopResultBuilder]: At program point L988(lines 977 990) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,419 INFO L854 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse16 (= ~token~0 ~local~0)) (.cse17 (<= ~t1_pc~0 0)) (.cse8 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse19 (= ~E_M~0 ~M_E~0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= 2 ~M_E~0)) (.cse10 (not (= 0 ~E_1~0))) (.cse12 (= ~t1_pc~0 1)) (.cse13 (not (= 1 ~E_1~0))) (.cse15 (<= 2 ~t1_st~0)) (.cse18 (= ~t1_st~0 0)) (.cse7 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse20 (not (= 0 ~m_st~0))) (.cse9 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse1 (= ~t1_i~0 1)) (.cse11 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= 0 ~q_req_up~0)) (.cse14 (= ~m_pc~0 0)) (.cse6 (= ~c_dr_st~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse3 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse13 .cse18 .cse19 .cse14) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse16 .cse3 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse17 .cse20 .cse9 .cse8 .cse10 .cse11 .cse13 .cse18 .cse19) (and (<= ~token~0 (+ ~local~0 1)) .cse0 .cse1 .cse2 .cse3 (< ~local~0 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse7 .cse20 .cse9 .cse1 .cse11 .cse4 .cse5 .cse18 .cse14 .cse6) (and (<= 1 ~t1_pc~0) .cse7 .cse20 .cse9 .cse1 .cse11 .cse4 .cse5 .cse14 .cse6))) [2021-12-17 21:11:07,419 INFO L854 garLoopResultBuilder]: At program point L559(lines 543 561) the Hoare annotation is: (and (= ~token~0 ~local~0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~m_st~0 0) (<= 2 ~fast_clk_edge~0) (= ~p_dw_st~0 0) (= ~E_1~0 ~M_E~0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (<= ~t1_pc~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (<= 2 ~slow_clk_edge~0) (= ~c_dr_i~0 1) (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 21:11:07,419 INFO L854 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse6 (not (= 0 ~p_dw_st~0))) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse7 (= ~c_dr_st~0 0)) (.cse0 (<= ~t1_pc~0 0)) (.cse8 (= ~c_dr_i~0 1)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse2 .cse3 (= 0 ~q_req_up~0) .cse7 (not (= 1 ~p_dw_pc~0)) .cse0 (= ~q_write_ev~0 ~q_read_ev~0) .cse8 (= ~c_dr_pc~0 ~q_req_up~0) (= 2 ~q_read_ev~0) .cse4 .cse5) (and (= ~token~0 ~local~0) (<= ~c_dr_pc~0 0) .cse6 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse7 .cse0 .cse8 (= ~t1_st~0 0) .cse4 .cse5))) [2021-12-17 21:11:07,419 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2021-12-17 21:11:07,419 INFO L854 garLoopResultBuilder]: At program point L989(lines 973 991) the Hoare annotation is: (let ((.cse4 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse5 (not (= 0 ~m_st~0))) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~t1_i~0 1)) (.cse7 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse2 (= 0 ~q_req_up~0)) (.cse8 (= ~m_pc~0 0)) (.cse3 (= ~c_dr_st~0 0))) (or (and (<= 2 ~E_M~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~E_1~0)) .cse7 (= ~t1_pc~0 1) (not (= 1 ~E_1~0)) (<= 2 ~t1_st~0)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 (= ~t1_st~0 0) .cse8 .cse3) (and (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3))) [2021-12-17 21:11:07,419 INFO L854 garLoopResultBuilder]: At program point L692(lines 663 698) the Hoare annotation is: (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse3 (= 2 ~M_E~0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= 0 ~q_req_up~0)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse15 (not (= 0 ~m_st~0))) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (not (= 0 ~E_1~0))) (.cse10 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (not (= 1 ~E_1~0))) (.cse14 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= ~token~0 (+ ~local~0 1)) .cse0 .cse1 .cse2 .cse3 (< ~local~0 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and (<= 1 ~t1_pc~0) .cse7 .cse15 .cse8 .cse1 .cse10 .cse4 .cse5 .cse13 .cse6) (and .cse0 .cse3 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14))) [2021-12-17 21:11:07,420 INFO L858 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2021-12-17 21:11:07,420 INFO L854 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~E_1~0 ~M_E~0)) (.cse3 (= 0 ~q_req_up~0)) (.cse4 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~c_dr_i~0 1)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (= 2 ~q_read_ev~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_pc~0 0))) (or (and (not (= 0 ~p_dw_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~token~0 ~local~0) .cse0 .cse1 (= ~m_st~0 0) (<= 2 ~fast_clk_edge~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~slow_clk_edge~0) .cse8 .cse9 .cse10 (= ~t1_st~0 0) .cse11 .cse12))) [2021-12-17 21:11:07,420 INFO L854 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~E_1~0 ~M_E~0)) (.cse3 (= 0 ~q_req_up~0)) (.cse4 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~c_dr_i~0 1)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (= 2 ~q_read_ev~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_pc~0 0))) (or (and (not (= 0 ~p_dw_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~token~0 ~local~0) .cse0 .cse1 (= ~m_st~0 0) (<= 2 ~fast_clk_edge~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~slow_clk_edge~0) .cse8 .cse9 .cse10 (= ~t1_st~0 0) .cse11 .cse12))) [2021-12-17 21:11:07,420 INFO L858 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2021-12-17 21:11:07,420 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 21:11:07,420 INFO L858 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2021-12-17 21:11:07,420 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2021-12-17 21:11:07,420 INFO L854 garLoopResultBuilder]: At program point L627(lines 622 661) the Hoare annotation is: (and (<= ~token~0 (+ ~local~0 1)) (<= 2 ~E_M~0) (= ~t1_i~0 1) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (< ~local~0 ~token~0) (= ~p_dw_st~0 0) (= 0 ~q_req_up~0) (= ~c_dr_st~0 0) (= ~p_dw_pc~0 ~q_req_up~0) (not (= 0 ~m_st~0)) (= ~q_write_ev~0 ~q_read_ev~0) (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|) (not (= 0 ~E_1~0)) (= ~c_dr_pc~0 ~q_req_up~0) (not (= 1 ~E_1~0)) (= ~t1_pc~0 1) (<= 2 ~t1_st~0)) [2021-12-17 21:11:07,421 INFO L854 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (= 2 ~M_E~0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~E_1~0 ~M_E~0)) (.cse3 (= 0 ~q_req_up~0)) (.cse4 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_pc~0 ~q_req_up~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse7 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse8 (= ~c_dr_i~0 1)) (.cse9 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (= 2 ~q_read_ev~0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_pc~0 0))) (or (and (not (= 0 ~p_dw_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~token~0 ~local~0) .cse0 .cse1 (= ~m_st~0 0) (<= 2 ~fast_clk_edge~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~slow_clk_edge~0) .cse8 .cse9 .cse10 (= ~t1_st~0 0) .cse11 .cse12))) [2021-12-17 21:11:07,421 INFO L858 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2021-12-17 21:11:07,421 INFO L858 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-12-17 21:11:07,421 INFO L858 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2021-12-17 21:11:07,421 INFO L858 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2021-12-17 21:11:07,421 INFO L854 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_st~0 0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse6 (not (= ~c_dr_i~0 1))) (.cse9 (not (= ~t1_st~0 0))) (.cse14 (not (= ~c_dr_st~0 0))) (.cse0 (= 1 ~p_dw_pc~0)) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~E_1~0 ~M_E~0))) (.cse11 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse12 (not (= 2 ~M_E~0))) (.cse8 (not (= 2 ~q_read_ev~0))) (.cse13 (not (= ~T1_E~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse0 .cse3 .cse4 .cse6 .cse7 .cse8 (= 0 ~p_dw_st~0) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse10 .cse12 .cse11 .cse13 .cse14) (or (not (= ~p_dw_pc~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (not (<= 2 ~fast_clk_edge~0)) .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse3 .cse10 .cse4 .cse7 (not (= ~c_dr_pc~0 1)) .cse11 .cse12 .cse8 .cse13))) [2021-12-17 21:11:07,421 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-12-17 21:11:07,421 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2021-12-17 21:11:07,421 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 70 98) no Hoare annotation was computed. [2021-12-17 21:11:07,422 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2021-12-17 21:11:07,422 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2021-12-17 21:11:07,422 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-12-17 21:11:07,422 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2021-12-17 21:11:07,422 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2021-12-17 21:11:07,422 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 295 314) no Hoare annotation was computed. [2021-12-17 21:11:07,422 INFO L861 garLoopResultBuilder]: At program point L311(lines 298 313) the Hoare annotation is: true [2021-12-17 21:11:07,422 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2021-12-17 21:11:07,422 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2021-12-17 21:11:07,423 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2021-12-17 21:11:07,423 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2021-12-17 21:11:07,423 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-12-17 21:11:07,423 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-12-17 21:11:07,423 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2021-12-17 21:11:07,423 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-12-17 21:11:07,423 INFO L858 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2021-12-17 21:11:07,423 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 763 782) no Hoare annotation was computed. [2021-12-17 21:11:07,424 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 763 782) the Hoare annotation is: true [2021-12-17 21:11:07,424 INFO L854 garLoopResultBuilder]: At program point L779(lines 766 781) the Hoare annotation is: (let ((.cse17 (not (= ~m_st~0 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= 2 ~E_M~0))) (.cse18 (not (<= 2 ~t1_st~0))) (.cse12 (= 0 ~m_st~0)) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (= 1 ~E_1~0)) (.cse2 (<= 1 exists_runnable_thread2_~__retres1~6)) (.cse3 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse21 (not (<= ~t1_pc~0 0))) (.cse4 (not (= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse10 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse11 (not (= 0 ~q_req_up~0))) (.cse19 (not (= ~m_pc~0 0))) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 2 ~M_E~0))) (.cse15 (not (= ~T1_E~0 ~M_E~0))) (.cse16 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse17 .cse3 (not (<= ~token~0 (+ ~local~0 1))) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 (not (< ~local~0 ~token~0)) .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse21 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse21 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse16))) [2021-12-17 21:11:07,424 INFO L858 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2021-12-17 21:11:07,424 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2021-12-17 21:11:07,424 INFO L858 garLoopResultBuilder]: For program point L337-1(lines 336 349) no Hoare annotation was computed. [2021-12-17 21:11:07,424 INFO L854 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: (let ((.cse4 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|))) (.cse0 (not (= ~E_M~0 ~M_E~0))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~c_dr_i~0 1))) (.cse3 (not (= ~E_1~0 ~M_E~0))) (.cse1 (not (= ~m_pc~0 0))) (.cse5 (not (= 2 ~M_E~0))) (.cse6 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~c_dr_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_dr_pc~0 1)) .cse4 .cse5 .cse6) (or (not (<= ~c_dr_pc~0 0)) (not (= ~m_st~0 0)) .cse0 .cse2 (not (= ~token~0 ~local~0)) .cse7 .cse3 (not (= ~t1_st~0 0)) .cse1 .cse4 .cse5 .cse6 .cse8) (or (= 1 ~p_dw_pc~0) (and (= ~q_write_ev~0 ~q_read_ev~0) (= 2 ~q_read_ev~0)) .cse0 (not (= |old(~q_write_ev~0)| |old(~q_read_ev~0)|)) .cse2 .cse7 .cse3 (not (= 2 |old(~q_read_ev~0)|)) (= 0 ~p_dw_st~0) (not (= ~c_dr_pc~0 ~q_req_up~0)) (not (= 0 ~q_req_up~0)) .cse1 .cse5 .cse6 .cse8))) [2021-12-17 21:11:07,425 INFO L858 garLoopResultBuilder]: For program point L342-1(lines 333 350) no Hoare annotation was computed. [2021-12-17 21:11:07,425 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2021-12-17 21:11:07,425 INFO L858 garLoopResultBuilder]: For program point L866-1(lines 865 888) no Hoare annotation was computed. [2021-12-17 21:11:07,425 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2021-12-17 21:11:07,425 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 862 889) the Hoare annotation is: (let ((.cse11 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~T1_E~0 |old(~T1_E~0)|))) (let ((.cse6 (= 0 ~m_st~0)) (.cse8 (and .cse11 (= ~M_E~0 |old(~M_E~0)|) .cse12 .cse13)) (.cse0 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse1 (not (= ~p_dw_pc~0 ~q_req_up~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse10 (not (= ~t1_st~0 0))) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse5 (not (= 0 ~q_req_up~0))) (.cse9 (not (= ~m_pc~0 0))) (.cse7 (not (= ~c_dr_st~0 0)))) (and (or .cse0 (= 0 |old(~E_1~0)|) .cse1 .cse2 (not (= ~t1_pc~0 1)) .cse3 .cse4 .cse5 .cse6 (not (<= 2 |old(~E_M~0)|)) (not (<= 2 ~t1_st~0)) (= 1 |old(~E_1~0)|) .cse7 .cse8) (or (not (<= 1 ~t1_pc~0)) .cse0 .cse2 .cse3 .cse1 .cse5 .cse9 .cse4 .cse6 .cse8 .cse7) (or .cse0 .cse2 .cse10 .cse3 .cse1 .cse5 .cse9 .cse4 .cse6 .cse8 .cse7) (or .cse0 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) .cse1 (not (= 2 |old(~M_E~0)|)) (not (<= ~t1_pc~0 0)) (and .cse11 .cse12 .cse13 (= ~E_1~0 ~M_E~0)) (not (= ~token~0 ~local~0)) .cse2 (not (= |old(~E_1~0)| |old(~M_E~0)|)) .cse10 .cse3 .cse4 .cse5 .cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse7)))) [2021-12-17 21:11:07,425 INFO L858 garLoopResultBuilder]: For program point L881-1(lines 862 889) no Hoare annotation was computed. [2021-12-17 21:11:07,425 INFO L858 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2021-12-17 21:11:07,425 INFO L858 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2021-12-17 21:11:07,428 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:11:07,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 21:11:07,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 09:11:07 BoogieIcfgContainer [2021-12-17 21:11:07,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 21:11:07,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 21:11:07,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 21:11:07,513 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 21:11:07,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:07:44" (3/4) ... [2021-12-17 21:11:07,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 21:11:07,520 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-17 21:11:07,520 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-12-17 21:11:07,520 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-12-17 21:11:07,520 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-12-17 21:11:07,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-12-17 21:11:07,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-12-17 21:11:07,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-12-17 21:11:07,521 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-17 21:11:07,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-17 21:11:07,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-12-17 21:11:07,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-12-17 21:11:07,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-12-17 21:11:07,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-12-17 21:11:07,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-12-17 21:11:07,529 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-12-17 21:11:07,531 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-17 21:11:07,532 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 21:11:07,532 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 21:11:07,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(c_dr_st == 0)) && (((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(token == local)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(c_dr_st == 0)) [2021-12-17 21:11:07,549 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 == M_E)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) && ((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || !(c_dr_st == 0))) && ((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(c_dr_st == 0))) && (((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0)) [2021-12-17 21:11:07,550 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(c_dr_pc <= 0) || !(m_st == 0)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || !(t1_st == 0)) || !(0 == \old(q_req_up))) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) && (((((((!(E_M == M_E) || !(m_pc == 0)) || !(t1_pc <= 0)) || !(E_1 == M_E)) || !(c_dr_pc == 1)) || 0 == q_req_up) || !(2 == M_E)) || !(T1_E == M_E))) && ((((((((((((!(c_dr_pc <= 0) || !(m_st == 0)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || 0 == q_req_up) || !(t1_st == 0)) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((!(c_dr_pc == \old(q_req_up)) || 1 == p_dw_pc) || !(E_M == M_E)) || !(\old(q_write_ev) == \old(q_read_ev))) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || !(2 == \old(q_read_ev))) || 0 == p_dw_st) || !(0 == \old(q_req_up))) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((!(0 == \old(q_req_up)) || !(E_M == M_E)) || !(m_pc == 0)) || !(t1_pc <= 0)) || !(E_1 == M_E)) || !(c_dr_pc == 1)) || !(2 == M_E)) || !(T1_E == M_E)) [2021-12-17 21:11:07,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || (((0 <= __retres1 && t1_st == \old(t1_st)) && __retres1 <= 0) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && 2 == M_E) && T1_E == M_E) && m_st == \old(m_st))) || !(token == local)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || (((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == 0) && 2 == M_E) && T1_E == M_E)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || !(t1_pc <= 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(c_dr_st == 0))) && ((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || (((((((((((1 <= t1_pc && p_dw_pc == q_req_up) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == 0) && 2 == M_E) && T1_E == M_E) && t1_i == 1) && 0 <= __retres1) && __retres1 <= 0) && c_dr_pc == q_req_up) && 0 == q_req_up)) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || (((((((((((1 <= t1_pc && p_dw_pc == q_req_up) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && 2 == M_E) && T1_E == M_E) && t1_i == 1) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && 0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0)) [2021-12-17 21:11:07,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && \result <= 0) && 2 == M_E) && T1_E == M_E) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == q_req_up)) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && \result <= 0) && m_st == 0) && 2 == M_E) && T1_E == M_E) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && c_dr_pc == q_req_up)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0)) && (((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || (((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || !(t1_pc <= 0)) || !(c_dr_st == 0))) && ((((((((((((((((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) || !(q_write_ev == q_read_ev)) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(t1_i == 1)) || (((((\old(t1_st) == t1_st && \result <= 0) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t1_i == 1)) || (\old(t1_st) == t1_st && m_st == 0)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(c_dr_st == 0)) [2021-12-17 21:11:07,598 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 21:11:07,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 21:11:07,599 INFO L158 Benchmark]: Toolchain (without parser) took 204155.53ms. Allocated memory was 100.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 59.3MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 943.5MB. Max. memory is 16.1GB. [2021-12-17 21:11:07,599 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 21:11:07,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.19ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 68.6MB in the end (delta: -9.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2021-12-17 21:11:07,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.09ms. Allocated memory is still 100.7MB. Free memory was 68.6MB in the beginning and 65.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 21:11:07,605 INFO L158 Benchmark]: Boogie Preprocessor took 48.12ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 63.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:11:07,605 INFO L158 Benchmark]: RCFGBuilder took 662.34ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 57.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 21:11:07,606 INFO L158 Benchmark]: TraceAbstraction took 202837.96ms. Allocated memory was 100.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 57.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-17 21:11:07,607 INFO L158 Benchmark]: Witness Printer took 85.97ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 21:11:07,608 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.19ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 68.6MB in the end (delta: -9.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.09ms. Allocated memory is still 100.7MB. Free memory was 68.6MB in the beginning and 65.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.12ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 63.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 662.34ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 57.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 202837.96ms. Allocated memory was 100.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 57.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 85.97ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. 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: 599]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 15 procedures, 224 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 202.7s, OverallIterations: 33, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 166.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20391 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19927 mSDsluCounter, 30870 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20637 mSDsCounter, 5157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17412 IncrementalHoareTripleChecker+Invalid, 22569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5157 mSolverCounterUnsat, 10233 mSDtfsCounter, 17412 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2380 GetRequests, 1900 SyntacticMatches, 4 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9227occurred in iteration=26, InterpolantAutomatonStates: 417, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 7642 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 89 LocationsWithAnnotation, 16078 PreInvPairs, 19420 NumberOfFragments, 11187 HoareAnnotationTreeSize, 16078 FomulaSimplifications, 17507 FormulaSimplificationTreeSizeReduction, 142.2s HoareSimplificationTime, 89 FomulaSimplificationsInter, 18167274 FormulaSimplificationTreeSizeReductionInter, 24.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 4436 NumberOfCodeBlocks, 4436 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4396 ConstructedInterpolants, 0 QuantifiedInterpolants, 8628 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3688 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 40 InterpolantComputations, 33 PerfectInterpolantSequences, 2182/2247 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 2 specifications checked. All of them hold - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= E_M && t1_i == 1) && T1_E == M_E) && 2 == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 1 <= tmp) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && m_pc == 0) && 2 <= t1_st) || (((((((((((((((token <= local + 1 && 2 <= E_M) && t1_i == 1) && T1_E == M_E) && 2 == M_E) && local < token) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0)) || ((((((((((((((2 <= E_M && 2 == M_E) && t1_i == 1) && T1_E == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || 1 <= __retres1) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(t1_st == 0)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == m_st) || 0 == E_1) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) && (((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || 1 <= __retres1) || !(m_st == 0)) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 <= t1_st)) || 0 == E_1) || !(2 == M_E)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || 1 <= __retres1) || !(m_st == 0)) || !(p_dw_pc == q_req_up)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(2 <= t1_st)) || 0 == E_1) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || 1 <= __retres1) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == m_st) || 0 == E_1) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || 1 <= __retres1) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || 0 == E_1) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_M && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st) || (((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && t1_st == 0) && m_pc == 0) && c_dr_st == 0)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || (((((((((((token == local && c_dr_pc <= 0) && t1_pc <= 0) && 2 == M_E) && m_st == 0) && T1_E == M_E) && c_dr_i == 1) && E_1 == M_E) && t1_st == 0) && E_M == M_E) && c_dr_st == 0) && m_pc == 0) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || (((((((((((token == local && c_dr_pc <= 0) && t1_pc <= 0) && 2 == M_E) && m_st == 0) && T1_E == M_E) && c_dr_i == 1) && E_1 == M_E) && t1_st == 0) && E_M == M_E) && c_dr_st == 0) && m_pc == 0) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == p_dw_pc || !(c_dr_pc <= 0)) || !(m_st == 0)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || !(2 == q_read_ev)) || !(t1_st == 0)) || !(m_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) && ((((((((((((((!(q_write_ev == q_read_ev) || 1 == p_dw_pc) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || !(2 == q_read_ev)) || 0 == p_dw_st) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((((((!(p_dw_pc == 1) || !(c_dr_pc <= 0)) || !(m_st == 0)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || !(t1_st == 0)) || !(m_pc == 0)) || !(2 <= fast_clk_edge)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((1 == p_dw_pc || !(E_M == M_E)) || !(m_pc == 0)) || !(t1_pc <= 0)) || !(E_1 == M_E)) || !(c_dr_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 == M_E)) || !(2 == q_read_ev)) || !(T1_E == M_E)) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || (((((((((((token == local && c_dr_pc <= 0) && t1_pc <= 0) && 2 == M_E) && m_st == 0) && T1_E == M_E) && c_dr_i == 1) && E_1 == M_E) && t1_st == 0) && E_M == M_E) && c_dr_st == 0) && m_pc == 0) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= E_M && t1_i == 1) && T1_E == M_E) && 2 == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 1 <= tmp) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && m_pc == 0) && 2 <= t1_st) || (((((((((((((((token == local && 2 == M_E) && T1_E == M_E) && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_st == 0) && E_M == M_E) && m_pc == 0)) || (((((((((((((((token == local && 2 <= E_M) && t1_i == 1) && T1_E == M_E) && 2 == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && t1_st == 0)) || ((((((((((((2 <= E_M && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 == M_E) && T1_E == M_E) && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && !(0 == m_st)) && q_write_ev == q_read_ev) && 1 <= tmp) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_st == 0) && E_M == M_E)) || (((((((((((((((token <= local + 1 && 2 <= E_M) && t1_i == 1) && T1_E == M_E) && 2 == M_E) && local < token) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st)) || (((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && t1_st == 0) && m_pc == 0) && c_dr_st == 0)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: (((((((((((((((((token == local && 2 == M_E) && T1_E == M_E) && m_st == 0) && 2 <= fast_clk_edge) && p_dw_st == 0) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 2 <= slow_clk_edge) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && t1_st == 0) && E_M == M_E) && m_pc == 0 - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: ((((((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(c_dr_st == 0)) && (((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(token == local)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(c_dr_st == 0)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(2 == M_E)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) && ((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && \result <= 0) && t1_st == 0)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || !(c_dr_st == 0))) && ((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(c_dr_st == 0))) && (((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || (((((0 <= \result && 0 <= __retres1) && __retres1 <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && p_dw_pc == 1) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((token == local && c_dr_pc <= 0) && !(0 == p_dw_st)) && 2 == M_E) && T1_E == M_E) && m_st == 0) && E_1 == M_E) && c_dr_st == 0) && t1_pc <= 0) && p_dw_pc == 1) && c_dr_i == 1) && t1_st == 0) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || (((((((((((token == local && c_dr_pc <= 0) && t1_pc <= 0) && 2 == M_E) && m_st == 0) && T1_E == M_E) && c_dr_i == 1) && E_1 == M_E) && t1_st == 0) && E_M == M_E) && c_dr_st == 0) && m_pc == 0) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: ((((((((((((((token == local && 2 == M_E) && T1_E == M_E) && t1_i == 1) && p_dw_st == 0) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && E_M == M_E) && m_pc == 0) || ((((((((((((((2 == M_E && T1_E == M_E) && t1_i == 1) && p_dw_st == 0) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && !(0 == m_st)) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 926]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_M && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st) || (((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && t1_st == 0) && m_pc == 0) && c_dr_st == 0)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || (((((((((((token == local && c_dr_pc <= 0) && t1_pc <= 0) && 2 == M_E) && m_st == 0) && T1_E == M_E) && c_dr_i == 1) && E_1 == M_E) && t1_st == 0) && E_M == M_E) && c_dr_st == 0) && m_pc == 0) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || (((0 <= __retres1 && t1_st == \old(t1_st)) && __retres1 <= 0) && m_st == \old(m_st))) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(c_dr_st == 0)) || !(2 <= \old(t1_st))) && (((((((((((((((!(q_write_ev == q_read_ev) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || (((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && 2 == M_E) && T1_E == M_E) && m_st == \old(m_st))) || !(token == local)) || !(t1_i == 1)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || (((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == 0) && 2 == M_E) && T1_E == M_E)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && (((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || !(t1_pc <= 0)) || (((0 <= __retres1 && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || !(c_dr_st == 0))) && ((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(c_dr_st == 0))) && ((((((((((((((((!(q_write_ev == q_read_ev) || (((((((((((1 <= t1_pc && p_dw_pc == q_req_up) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == 0) && 2 == M_E) && T1_E == M_E) && t1_i == 1) && 0 <= __retres1) && __retres1 <= 0) && c_dr_pc == q_req_up) && 0 == q_req_up)) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || (((((((((((1 <= t1_pc && p_dw_pc == q_req_up) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && 2 == M_E) && T1_E == M_E) && t1_i == 1) && 0 <= __retres1) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == q_req_up) && 0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((((((token == local && 2 <= E_M) && t1_i == 1) && 2 == M_E) && T1_E == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_pc == 1) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: 2 == M_E - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0 - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((((((token == local && c_dr_pc <= 0) && !(0 == p_dw_st)) && 2 == M_E) && m_st == 0) && T1_E == M_E) && E_1 == M_E) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && c_dr_i == 1) && t1_st == 0) && E_M == M_E) && m_pc == 0) || (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && c_dr_pc == q_req_up) && E_1 == M_E) && E_M == M_E) && m_pc == 0)) || (((((((!(1 == p_dw_pc) && t1_pc <= 0) && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0)) || (((((((((((((token == local && c_dr_pc <= 0) && !(0 == p_dw_st)) && 2 == M_E) && m_st == 0) && T1_E == M_E) && E_1 == M_E) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && c_dr_i == 1) && t1_st == 0) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 2 == M_E - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ((((((((((((((((token <= local + 1 && 2 <= E_M) && t1_i == 1) && 2 == M_E) && T1_E == M_E) && local < token) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && 1 <= tmp) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_pc == 1) && 2 <= t1_st - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((((((((((token == local && T1_E == M_E) && t1_i == 1) && 2 == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && !(0 == m_st)) && q_write_ev == q_read_ev) && 1 <= tmp) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_st == 0) && E_M == M_E) && m_pc == 0) || (((((((((((((((2 <= E_M && 2 == M_E) && T1_E == M_E) && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && 1 <= tmp) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_pc == 1) && 2 <= t1_st) - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: ((((((((((((((token == local && 2 == M_E) && T1_E == M_E) && t1_i == 1) && m_st == 0) && p_dw_st == 0) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && t1_st == 0) && E_M == M_E) && m_pc == 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((!(c_dr_pc <= 0) || !(m_st == 0)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || !(t1_st == 0)) || !(0 == \old(q_req_up))) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) && (((((((!(E_M == M_E) || !(m_pc == 0)) || !(t1_pc <= 0)) || !(E_1 == M_E)) || !(c_dr_pc == 1)) || 0 == q_req_up) || !(2 == M_E)) || !(T1_E == M_E))) && ((((((((((((!(c_dr_pc <= 0) || !(m_st == 0)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || 0 == q_req_up) || !(t1_st == 0)) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((!(c_dr_pc == \old(q_req_up)) || 1 == p_dw_pc) || !(E_M == M_E)) || !(\old(q_write_ev) == \old(q_read_ev))) || !(t1_pc <= 0)) || !(c_dr_i == 1)) || !(E_1 == M_E)) || !(2 == \old(q_read_ev))) || 0 == p_dw_st) || !(0 == \old(q_req_up))) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((!(0 == \old(q_req_up)) || !(E_M == M_E)) || !(m_pc == 0)) || !(t1_pc <= 0)) || !(E_1 == M_E)) || !(c_dr_pc == 1)) || !(2 == M_E)) || !(T1_E == M_E)) - InvariantResult [Line: 1004]: Loop Invariant Derived loop invariant: (((((((((((((((((token == local && T1_E == M_E) && t1_i == 1) && 2 == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_st == 0) && E_M == M_E) && m_pc == 0) || ((((((((((((2 <= E_M && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st)) || (((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && t1_st == 0) && m_pc == 0) && c_dr_st == 0)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_M && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st) || (((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && t1_st == 0) && m_pc == 0) && c_dr_st == 0)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && p_dw_pc == 1) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((token == local && c_dr_pc <= 0) && !(0 == p_dw_st)) && 2 == M_E) && T1_E == M_E) && m_st == 0) && E_1 == M_E) && c_dr_st == 0) && t1_pc <= 0) && p_dw_pc == 1) && c_dr_i == 1) && t1_st == 0) && E_M == M_E) && m_pc == 0)) || (((((((!(1 == p_dw_pc) && t1_pc <= 0) && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0)) || (((((((((((((token == local && c_dr_pc <= 0) && !(0 == p_dw_st)) && 2 == M_E) && T1_E == M_E) && m_st == 0) && E_1 == M_E) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && c_dr_i == 1) && t1_st == 0) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || (((((((((((token == local && c_dr_pc <= 0) && t1_pc <= 0) && 2 == M_E) && m_st == 0) && T1_E == M_E) && c_dr_i == 1) && E_1 == M_E) && t1_st == 0) && E_M == M_E) && c_dr_st == 0) && m_pc == 0) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0) || (((((((((((((((((token == local && 2 == M_E) && T1_E == M_E) && m_st == 0) && 2 <= fast_clk_edge) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && q_write_ev == q_read_ev) && 2 <= slow_clk_edge) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && t1_st == 0) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || (((((((((((token == local && c_dr_pc <= 0) && t1_pc <= 0) && 2 == M_E) && m_st == 0) && T1_E == M_E) && c_dr_i == 1) && E_1 == M_E) && t1_st == 0) && E_M == M_E) && c_dr_st == 0) && m_pc == 0) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((!(q_write_ev == q_read_ev) || 1 == p_dw_pc) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(E_1 == M_E)) || !(c_dr_i == 1)) || !(2 == q_read_ev)) || 0 == p_dw_st) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(T1_E == M_E)) || !(c_dr_st == 0)) && ((((((((((((!(c_dr_pc <= 0) || !(m_st == 0)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(E_1 == M_E)) || !(token == local)) || !(c_dr_i == 1)) || !(t1_st == 0)) || !(m_pc == 0)) || !(2 == M_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(T1_E == M_E)) || !(c_dr_st == 0)) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && \result <= 0) && 2 == M_E) && T1_E == M_E) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && c_dr_pc == q_req_up)) || !(p_dw_pc == q_req_up)) || !(token <= local + 1)) || !(t1_i == 1)) || !(t1_pc == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(2 == M_E)) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && \result <= 0) && m_st == 0) && 2 == M_E) && T1_E == M_E) && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && c_dr_pc == q_req_up)) || !(local < token)) || !(T1_E == M_E)) || !(c_dr_st == 0)) && (((((((((((!(q_write_ev == q_read_ev) || !(t1_i == 1)) || (((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0)) || 0 == \old(m_st)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || !(t1_pc <= 0)) || !(c_dr_st == 0))) && ((((((((((((((((((((\result <= 0 && 0 <= __retres1) && 0 <= \result) && __retres1 <= 0) && m_st == \old(m_st)) && t1_st == 0) || !(q_write_ev == q_read_ev)) || !(\old(t1_st) == 0)) || !(p_dw_pc == q_req_up)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(token == local)) || !(E_1 == M_E)) || !(t1_i == 1)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0))) && (((((((((((((!(q_write_ev == q_read_ev) || 1 == E_1) || !(p_dw_pc == q_req_up)) || !(t1_i == 1)) || (((((\old(t1_st) == t1_st && \result <= 0) && 0 <= __retres1) && 0 <= \result) && m_st == \old(m_st)) && __retres1 <= 0)) || !(t1_pc == 1)) || !(2 <= E_M)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || 0 == E_1) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((((((((!(q_write_ev == q_read_ev) || !(p_dw_pc == q_req_up)) || !(token == local)) || !(t1_i == 1)) || (\old(t1_st) == t1_st && m_st == 0)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(E_1 == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(c_dr_pc == q_req_up)) || !(0 == q_req_up)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(2 == M_E)) || !(T1_E == M_E)) || !(c_dr_st == 0)) || !(2 <= \old(t1_st)))) && ((((((((((!(1 <= t1_pc) || !(q_write_ev == q_read_ev)) || !(t1_i == 1)) || 0 == \old(m_st)) || !(p_dw_st == 0)) || !(p_dw_pc == q_req_up)) || !(0 == q_req_up)) || !(m_pc == 0)) || !(c_dr_pc == q_req_up)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(c_dr_st == 0)) - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: (((((((((((((((((token == local && 2 == M_E) && T1_E == M_E) && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && t1_pc <= 0) && !(0 == m_st)) && q_write_ev == q_read_ev) && 1 <= tmp) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_st == 0) && E_M == M_E) || ((((((((((((((((token == local && 2 <= E_M) && 2 == M_E) && t1_i == 1) && T1_E == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && 1 <= tmp) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st)) || ((((((((((((((((token == local && 2 <= E_M) && 2 == M_E) && t1_i == 1) && T1_E == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && 1 <= tmp) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && t1_st == 0) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_M && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st) || (((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && t1_st == 0) && m_pc == 0) && c_dr_st == 0)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && c_dr_pc == 1) && E_1 == M_E) && E_M == M_E) && m_pc == 0) || (((((((((((((!(0 == p_dw_st) && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && 0 == q_req_up) && c_dr_st == 0) && !(1 == p_dw_pc)) && t1_pc <= 0) && q_write_ev == q_read_ev) && c_dr_i == 1) && c_dr_pc == q_req_up) && 2 == q_read_ev) && E_M == M_E) && m_pc == 0)) || ((((((((((((token == local && c_dr_pc <= 0) && !(0 == p_dw_st)) && 2 == M_E) && m_st == 0) && T1_E == M_E) && E_1 == M_E) && c_dr_st == 0) && t1_pc <= 0) && c_dr_i == 1) && t1_st == 0) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) || ((((((((((((((2 <= E_M && t1_i == 1) && 2 == M_E) && T1_E == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && 1 <= tmp) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && t1_pc == 1) && m_pc == 0)) || ((((((((((((((token == local && t1_i == 1) && 2 == M_E) && T1_E == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && 1 <= tmp) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && E_M == M_E)) || (((((((((((((2 <= E_M && t1_i == 1) && T1_E == M_E) && 2 == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && !(1 == E_1)) && t1_pc == 1) && c_dr_pc == q_req_up)) || ((((((((((((((token <= local + 1 && 2 <= E_M) && t1_i == 1) && T1_E == M_E) && 2 == M_E) && local < token) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && !(0 == E_1)) && !(1 == E_1)) && t1_pc == 1) && c_dr_pc == q_req_up)) || ((((((((((((((token == local && t1_i == 1) && 2 == M_E) && T1_E == M_E) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && q_write_ev == q_read_ev) && 1 <= tmp) && !(0 == E_1)) && c_dr_pc == q_req_up) && !(1 == E_1)) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_M && t1_i == 1) && p_dw_st == 0) && 0 == q_req_up) && c_dr_st == 0) && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && !(0 == E_1)) && c_dr_pc == q_req_up) && t1_pc == 1) && !(1 == E_1)) && 2 <= t1_st) || (((((((((p_dw_pc == q_req_up && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && t1_st == 0) && m_pc == 0) && c_dr_st == 0)) || (((((((((1 <= t1_pc && p_dw_pc == q_req_up) && !(0 == m_st)) && q_write_ev == q_read_ev) && t1_i == 1) && c_dr_pc == q_req_up) && p_dw_st == 0) && 0 == q_req_up) && m_pc == 0) && c_dr_st == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && E_M == M_E) && m_pc == 0 RESULT: Ultimate proved your program to be correct! [2021-12-17 21:11:07,682 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