./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 17:51:20,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 17:51:20,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 17:51:20,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 17:51:20,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 17:51:20,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 17:51:20,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 17:51:20,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 17:51:20,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 17:51:20,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 17:51:20,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 17:51:20,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 17:51:20,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 17:51:20,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 17:51:20,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 17:51:20,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 17:51:20,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 17:51:20,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 17:51:20,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 17:51:20,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 17:51:20,605 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 17:51:20,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 17:51:20,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 17:51:20,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 17:51:20,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 17:51:20,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 17:51:20,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 17:51:20,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 17:51:20,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 17:51:20,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 17:51:20,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 17:51:20,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 17:51:20,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 17:51:20,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 17:51:20,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 17:51:20,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 17:51:20,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 17:51:20,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 17:51:20,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 17:51:20,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 17:51:20,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 17:51:20,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 17:51:20,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 17:51:20,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 17:51:20,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 17:51:20,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 17:51:20,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 17:51:20,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 17:51:20,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 17:51:20,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 17:51:20,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 17:51:20,644 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 17:51:20,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 17:51:20,644 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 17:51:20,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 17:51:20,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 17:51:20,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 17:51:20,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 17:51:20,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 17:51:20,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 17:51:20,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 17:51:20,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 17:51:20,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 17:51:20,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 17:51:20,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 17:51:20,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 17:51:20,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 17:51:20,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:51:20,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 17:51:20,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 17:51:20,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 17:51:20,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 17:51:20,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 17:51:20,649 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 17:51:20,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 17:51:20,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 17:51:20,649 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-07-22 17:51:20,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 17:51:20,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 17:51:20,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 17:51:20,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 17:51:20,888 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 17:51:20,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-07-22 17:51:20,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff9cf363/522c64f84bab48ed9def146dd999148c/FLAGd409bc26d [2022-07-22 17:51:21,333 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 17:51:21,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-07-22 17:51:21,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff9cf363/522c64f84bab48ed9def146dd999148c/FLAGd409bc26d [2022-07-22 17:51:21,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff9cf363/522c64f84bab48ed9def146dd999148c [2022-07-22 17:51:21,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 17:51:21,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 17:51:21,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 17:51:21,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 17:51:21,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 17:51:21,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a65cddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21, skipping insertion in model container [2022-07-22 17:51:21,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 17:51:21,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 17:51:21,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-07-22 17:51:21,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:51:21,573 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 17:51:21,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-07-22 17:51:21,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:51:21,613 INFO L208 MainTranslator]: Completed translation [2022-07-22 17:51:21,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21 WrapperNode [2022-07-22 17:51:21,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 17:51:21,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 17:51:21,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 17:51:21,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 17:51:21,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,667 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 215 [2022-07-22 17:51:21,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 17:51:21,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 17:51:21,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 17:51:21,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 17:51:21,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 17:51:21,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 17:51:21,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 17:51:21,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 17:51:21,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (1/1) ... [2022-07-22 17:51:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:51:21,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:21,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 17:51:21,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 17:51:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 17:51:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-22 17:51:21,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-22 17:51:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-22 17:51:21,791 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-22 17:51:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-22 17:51:21,791 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-22 17:51:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-22 17:51:21,791 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-22 17:51:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-22 17:51:21,791 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-22 17:51:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 17:51:21,791 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-22 17:51:21,791 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-22 17:51:21,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 17:51:21,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 17:51:21,845 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 17:51:21,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 17:51:22,054 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 17:51:22,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 17:51:22,061 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 17:51:22,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:51:22 BoogieIcfgContainer [2022-07-22 17:51:22,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 17:51:22,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 17:51:22,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 17:51:22,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 17:51:22,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:51:21" (1/3) ... [2022-07-22 17:51:22,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f638fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:51:22, skipping insertion in model container [2022-07-22 17:51:22,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:51:21" (2/3) ... [2022-07-22 17:51:22,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f638fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:51:22, skipping insertion in model container [2022-07-22 17:51:22,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:51:22" (3/3) ... [2022-07-22 17:51:22,070 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-07-22 17:51:22,081 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 17:51:22,095 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 17:51:22,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 17:51:22,148 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@460d4a9f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e474904 [2022-07-22 17:51:22,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 17:51:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-22 17:51:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 17:51:22,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:22,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:22,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1624964503, now seen corresponding path program 1 times [2022-07-22 17:51:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:22,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213827443] [2022-07-22 17:51:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:22,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:22,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:51:22,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:22,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213827443] [2022-07-22 17:51:22,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213827443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:22,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:51:22,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:51:22,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526904585] [2022-07-22 17:51:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:22,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:51:22,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:22,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:51:22,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:51:22,518 INFO L87 Difference]: Start difference. First operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-22 17:51:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:23,169 INFO L93 Difference]: Finished difference Result 339 states and 511 transitions. [2022-07-22 17:51:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 17:51:23,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 56 [2022-07-22 17:51:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:23,188 INFO L225 Difference]: With dead ends: 339 [2022-07-22 17:51:23,189 INFO L226 Difference]: Without dead ends: 233 [2022-07-22 17:51:23,192 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:51:23,195 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 293 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:23,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 448 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 17:51:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-22 17:51:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2022-07-22 17:51:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 155 states have internal predecessors, (219), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-22 17:51:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 272 transitions. [2022-07-22 17:51:23,250 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 272 transitions. Word has length 56 [2022-07-22 17:51:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:23,251 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 272 transitions. [2022-07-22 17:51:23,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-22 17:51:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 272 transitions. [2022-07-22 17:51:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 17:51:23,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:23,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:23,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 17:51:23,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash 713012507, now seen corresponding path program 1 times [2022-07-22 17:51:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:23,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436478247] [2022-07-22 17:51:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:51:23,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:23,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436478247] [2022-07-22 17:51:23,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436478247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:23,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:51:23,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:51:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833032088] [2022-07-22 17:51:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:23,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:51:23,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:23,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:51:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:51:23,360 INFO L87 Difference]: Start difference. First operand 192 states and 272 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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) [2022-07-22 17:51:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:23,915 INFO L93 Difference]: Finished difference Result 524 states and 746 transitions. [2022-07-22 17:51:23,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 17:51:23,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2022-07-22 17:51:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:23,919 INFO L225 Difference]: With dead ends: 524 [2022-07-22 17:51:23,919 INFO L226 Difference]: Without dead ends: 341 [2022-07-22 17:51:23,921 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:51:23,922 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:23,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 685 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:51:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-22 17:51:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 277. [2022-07-22 17:51:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 221 states have (on average 1.420814479638009) internal successors, (314), 224 states have internal predecessors, (314), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-22 17:51:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 389 transitions. [2022-07-22 17:51:23,952 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 389 transitions. Word has length 56 [2022-07-22 17:51:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:23,953 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 389 transitions. [2022-07-22 17:51:23,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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) [2022-07-22 17:51:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 389 transitions. [2022-07-22 17:51:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 17:51:23,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:23,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:23,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 17:51:23,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1336375335, now seen corresponding path program 1 times [2022-07-22 17:51:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:23,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831823374] [2022-07-22 17:51:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:51:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:24,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831823374] [2022-07-22 17:51:24,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831823374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:24,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:51:24,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:51:24,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136527054] [2022-07-22 17:51:24,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:24,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:51:24,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:24,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:51:24,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:51:24,078 INFO L87 Difference]: Start difference. First operand 277 states and 389 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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) [2022-07-22 17:51:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:24,687 INFO L93 Difference]: Finished difference Result 860 states and 1213 transitions. [2022-07-22 17:51:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 17:51:24,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2022-07-22 17:51:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:24,694 INFO L225 Difference]: With dead ends: 860 [2022-07-22 17:51:24,695 INFO L226 Difference]: Without dead ends: 592 [2022-07-22 17:51:24,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-22 17:51:24,707 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 328 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:24,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 667 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 17:51:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-22 17:51:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 442. [2022-07-22 17:51:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4152542372881356) internal successors, (501), 359 states have internal predecessors, (501), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-22 17:51:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 620 transitions. [2022-07-22 17:51:24,758 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 620 transitions. Word has length 56 [2022-07-22 17:51:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:24,758 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 620 transitions. [2022-07-22 17:51:24,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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) [2022-07-22 17:51:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 620 transitions. [2022-07-22 17:51:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 17:51:24,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:24,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:24,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 17:51:24,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2061198683, now seen corresponding path program 1 times [2022-07-22 17:51:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102486715] [2022-07-22 17:51:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:51:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:24,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102486715] [2022-07-22 17:51:24,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102486715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:24,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:51:24,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:51:24,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909339899] [2022-07-22 17:51:24,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:24,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:51:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:24,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:51:24,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:51:24,843 INFO L87 Difference]: Start difference. First operand 442 states and 620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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) [2022-07-22 17:51:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:25,108 INFO L93 Difference]: Finished difference Result 961 states and 1363 transitions. [2022-07-22 17:51:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:51:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2022-07-22 17:51:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:25,112 INFO L225 Difference]: With dead ends: 961 [2022-07-22 17:51:25,112 INFO L226 Difference]: Without dead ends: 528 [2022-07-22 17:51:25,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:51:25,123 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 250 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:25,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 295 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:51:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-07-22 17:51:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 442. [2022-07-22 17:51:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4011299435028248) internal successors, (496), 359 states have internal predecessors, (496), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-22 17:51:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 615 transitions. [2022-07-22 17:51:25,170 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 615 transitions. Word has length 56 [2022-07-22 17:51:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:25,172 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 615 transitions. [2022-07-22 17:51:25,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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) [2022-07-22 17:51:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 615 transitions. [2022-07-22 17:51:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 17:51:25,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:25,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:25,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 17:51:25,188 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1985622119, now seen corresponding path program 1 times [2022-07-22 17:51:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:25,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913012835] [2022-07-22 17:51:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:51:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:25,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913012835] [2022-07-22 17:51:25,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913012835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:25,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:51:25,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:51:25,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011508390] [2022-07-22 17:51:25,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:25,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:51:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:51:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:51:25,284 INFO L87 Difference]: Start difference. First operand 442 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-22 17:51:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:25,747 INFO L93 Difference]: Finished difference Result 1435 states and 2006 transitions. [2022-07-22 17:51:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 17:51:25,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 56 [2022-07-22 17:51:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:25,753 INFO L225 Difference]: With dead ends: 1435 [2022-07-22 17:51:25,753 INFO L226 Difference]: Without dead ends: 1003 [2022-07-22 17:51:25,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:51:25,756 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 379 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:25,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 535 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:51:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-07-22 17:51:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 846. [2022-07-22 17:51:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 675 states have (on average 1.3733333333333333) internal successors, (927), 689 states have internal predecessors, (927), 102 states have call successors, (102), 60 states have call predecessors, (102), 68 states have return successors, (125), 100 states have call predecessors, (125), 102 states have call successors, (125) [2022-07-22 17:51:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1154 transitions. [2022-07-22 17:51:25,804 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1154 transitions. Word has length 56 [2022-07-22 17:51:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:25,805 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1154 transitions. [2022-07-22 17:51:25,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-07-22 17:51:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1154 transitions. [2022-07-22 17:51:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 17:51:25,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:25,808 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:51:25,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 17:51:25,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash -34790867, now seen corresponding path program 1 times [2022-07-22 17:51:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:25,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458890843] [2022-07-22 17:51:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 17:51:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 17:51:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:51:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:25,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458890843] [2022-07-22 17:51:25,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458890843] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:25,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660218482] [2022-07-22 17:51:25,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:25,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:25,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:51:25,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 17:51:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 17:51:26,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 17:51:26,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660218482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:26,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:26,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 17:51:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698211654] [2022-07-22 17:51:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:26,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:51:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:51:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:26,103 INFO L87 Difference]: Start difference. First operand 846 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:26,254 INFO L93 Difference]: Finished difference Result 2437 states and 3376 transitions. [2022-07-22 17:51:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:51:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2022-07-22 17:51:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:26,264 INFO L225 Difference]: With dead ends: 2437 [2022-07-22 17:51:26,264 INFO L226 Difference]: Without dead ends: 1602 [2022-07-22 17:51:26,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:26,268 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 113 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:26,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:51:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-07-22 17:51:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-07-22 17:51:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1280 states have (on average 1.36171875) internal successors, (1743), 1303 states have internal predecessors, (1743), 189 states have call successors, (189), 116 states have call predecessors, (189), 132 states have return successors, (260), 190 states have call predecessors, (260), 189 states have call successors, (260) [2022-07-22 17:51:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2192 transitions. [2022-07-22 17:51:26,366 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2192 transitions. Word has length 91 [2022-07-22 17:51:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:26,368 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2192 transitions. [2022-07-22 17:51:26,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2192 transitions. [2022-07-22 17:51:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-22 17:51:26,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:26,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:26,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:26,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 17:51:26,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:26,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1902655295, now seen corresponding path program 1 times [2022-07-22 17:51:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:26,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357627466] [2022-07-22 17:51:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 17:51:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 17:51:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 17:51:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 17:51:26,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:26,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357627466] [2022-07-22 17:51:26,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357627466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:26,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591035733] [2022-07-22 17:51:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:26,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:51:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 17:51:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:26,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 17:51:26,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 17:51:26,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:26,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591035733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:26,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:26,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-22 17:51:26,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316647375] [2022-07-22 17:51:26,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:26,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:51:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:51:26,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:26,919 INFO L87 Difference]: Start difference. First operand 1602 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-22 17:51:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:27,068 INFO L93 Difference]: Finished difference Result 4682 states and 6441 transitions. [2022-07-22 17:51:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:51:27,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2022-07-22 17:51:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:27,082 INFO L225 Difference]: With dead ends: 4682 [2022-07-22 17:51:27,083 INFO L226 Difference]: Without dead ends: 3094 [2022-07-22 17:51:27,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:27,088 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 68 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:27,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 277 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:51:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-22 17:51:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3052. [2022-07-22 17:51:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3052 states, 2440 states have (on average 1.353688524590164) internal successors, (3303), 2484 states have internal predecessors, (3303), 353 states have call successors, (353), 226 states have call predecessors, (353), 258 states have return successors, (476), 349 states have call predecessors, (476), 353 states have call successors, (476) [2022-07-22 17:51:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 4132 transitions. [2022-07-22 17:51:27,254 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 4132 transitions. Word has length 117 [2022-07-22 17:51:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:27,254 INFO L495 AbstractCegarLoop]: Abstraction has 3052 states and 4132 transitions. [2022-07-22 17:51:27,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-22 17:51:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 4132 transitions. [2022-07-22 17:51:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-22 17:51:27,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:27,264 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:27,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:27,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-22 17:51:27,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash -844102889, now seen corresponding path program 1 times [2022-07-22 17:51:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:27,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841004210] [2022-07-22 17:51:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 17:51:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 17:51:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 17:51:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 17:51:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-22 17:51:27,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:27,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841004210] [2022-07-22 17:51:27,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841004210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:27,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511170676] [2022-07-22 17:51:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:27,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:27,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:51:27,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 17:51:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:27,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:51:27,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 17:51:27,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:27,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511170676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:27,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:27,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 17:51:27,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343129129] [2022-07-22 17:51:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:27,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:51:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:51:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:27,750 INFO L87 Difference]: Start difference. First operand 3052 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 17:51:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:27,916 INFO L93 Difference]: Finished difference Result 5716 states and 7745 transitions. [2022-07-22 17:51:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:51:27,917 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 133 [2022-07-22 17:51:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:27,933 INFO L225 Difference]: With dead ends: 5716 [2022-07-22 17:51:27,934 INFO L226 Difference]: Without dead ends: 3388 [2022-07-22 17:51:27,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:27,941 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 100 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:27,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:51:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2022-07-22 17:51:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3350. [2022-07-22 17:51:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 2706 states have (on average 1.3263118994826313) internal successors, (3589), 2750 states have internal predecessors, (3589), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2022-07-22 17:51:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4456 transitions. [2022-07-22 17:51:28,137 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4456 transitions. Word has length 133 [2022-07-22 17:51:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:28,137 INFO L495 AbstractCegarLoop]: Abstraction has 3350 states and 4456 transitions. [2022-07-22 17:51:28,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 17:51:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4456 transitions. [2022-07-22 17:51:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 17:51:28,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:28,145 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:28,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:28,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:28,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -797474129, now seen corresponding path program 1 times [2022-07-22 17:51:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:28,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786332925] [2022-07-22 17:51:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 17:51:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 17:51:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:28,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786332925] [2022-07-22 17:51:28,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786332925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:28,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589969614] [2022-07-22 17:51:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:28,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:28,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:28,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:51:28,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 17:51:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:28,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:51:28,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 17:51:28,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:28,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589969614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:28,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:28,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 17:51:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090324911] [2022-07-22 17:51:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:28,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:51:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:28,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:51:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:28,609 INFO L87 Difference]: Start difference. First operand 3350 states and 4456 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 17:51:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:28,780 INFO L93 Difference]: Finished difference Result 5125 states and 6937 transitions. [2022-07-22 17:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:51:28,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 134 [2022-07-22 17:51:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:28,796 INFO L225 Difference]: With dead ends: 5125 [2022-07-22 17:51:28,796 INFO L226 Difference]: Without dead ends: 3376 [2022-07-22 17:51:28,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:28,803 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:28,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:51:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2022-07-22 17:51:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3334. [2022-07-22 17:51:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.3022304832713754) internal successors, (3503), 2734 states have internal predecessors, (3503), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2022-07-22 17:51:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4370 transitions. [2022-07-22 17:51:28,993 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4370 transitions. Word has length 134 [2022-07-22 17:51:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:28,994 INFO L495 AbstractCegarLoop]: Abstraction has 3334 states and 4370 transitions. [2022-07-22 17:51:28,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 17:51:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4370 transitions. [2022-07-22 17:51:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 17:51:29,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:29,002 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:29,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:29,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:29,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -215256625, now seen corresponding path program 1 times [2022-07-22 17:51:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:29,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039673952] [2022-07-22 17:51:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 17:51:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 17:51:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:29,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039673952] [2022-07-22 17:51:29,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039673952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:29,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403557931] [2022-07-22 17:51:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:29,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:29,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:29,331 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) [2022-07-22 17:51:29,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 17:51:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:29,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 17:51:29,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:51:29,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:29,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403557931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:29,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:29,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 17:51:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392911644] [2022-07-22 17:51:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:29,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:51:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:51:29,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:29,445 INFO L87 Difference]: Start difference. First operand 3334 states and 4370 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 17:51:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:29,636 INFO L93 Difference]: Finished difference Result 6834 states and 9069 transitions. [2022-07-22 17:51:29,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:51:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2022-07-22 17:51:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:29,652 INFO L225 Difference]: With dead ends: 6834 [2022-07-22 17:51:29,652 INFO L226 Difference]: Without dead ends: 3516 [2022-07-22 17:51:29,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:51:29,662 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:29,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:51:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2022-07-22 17:51:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3334. [2022-07-22 17:51:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.262081784386617) internal successors, (3395), 2734 states have internal predecessors, (3395), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (482), 355 states have call predecessors, (482), 359 states have call successors, (482) [2022-07-22 17:51:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4236 transitions. [2022-07-22 17:51:29,859 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4236 transitions. Word has length 134 [2022-07-22 17:51:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:29,859 INFO L495 AbstractCegarLoop]: Abstraction has 3334 states and 4236 transitions. [2022-07-22 17:51:29,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-22 17:51:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4236 transitions. [2022-07-22 17:51:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 17:51:29,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:29,867 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:29,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 17:51:30,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 17:51:30,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:30,080 INFO L85 PathProgramCache]: Analyzing trace with hash -564777140, now seen corresponding path program 1 times [2022-07-22 17:51:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:30,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425820196] [2022-07-22 17:51:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:51:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 17:51:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425820196] [2022-07-22 17:51:30,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425820196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572470284] [2022-07-22 17:51:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:30,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:30,176 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) [2022-07-22 17:51:30,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 17:51:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:30,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:51:30,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-22 17:51:30,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:30,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572470284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:30,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:30,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 17:51:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473872072] [2022-07-22 17:51:30,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:30,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:51:30,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:51:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:51:30,361 INFO L87 Difference]: Start difference. First operand 3334 states and 4236 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:30,593 INFO L93 Difference]: Finished difference Result 4752 states and 6093 transitions. [2022-07-22 17:51:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:51:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-22 17:51:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:30,606 INFO L225 Difference]: With dead ends: 4752 [2022-07-22 17:51:30,606 INFO L226 Difference]: Without dead ends: 2682 [2022-07-22 17:51:30,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:51:30,612 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:30,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 257 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:51:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2022-07-22 17:51:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2658. [2022-07-22 17:51:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2142 states have (on average 1.2254901960784315) internal successors, (2625), 2168 states have internal predecessors, (2625), 295 states have call successors, (295), 204 states have call predecessors, (295), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-07-22 17:51:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3274 transitions. [2022-07-22 17:51:30,776 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3274 transitions. Word has length 135 [2022-07-22 17:51:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:30,776 INFO L495 AbstractCegarLoop]: Abstraction has 2658 states and 3274 transitions. [2022-07-22 17:51:30,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3274 transitions. [2022-07-22 17:51:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 17:51:30,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:30,781 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:30,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:31,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:31,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1871919538, now seen corresponding path program 1 times [2022-07-22 17:51:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:31,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841194715] [2022-07-22 17:51:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:31,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:51:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 17:51:31,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:31,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841194715] [2022-07-22 17:51:31,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841194715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:31,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928077292] [2022-07-22 17:51:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:31,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:31,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:31,107 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) [2022-07-22 17:51:31,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 17:51:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:31,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:51:31,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-22 17:51:31,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:31,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928077292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:31,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:31,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 17:51:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491607303] [2022-07-22 17:51:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:31,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:51:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:51:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:51:31,275 INFO L87 Difference]: Start difference. First operand 2658 states and 3274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:31,583 INFO L93 Difference]: Finished difference Result 4962 states and 6189 transitions. [2022-07-22 17:51:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:51:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-22 17:51:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:31,601 INFO L225 Difference]: With dead ends: 4962 [2022-07-22 17:51:31,601 INFO L226 Difference]: Without dead ends: 2611 [2022-07-22 17:51:31,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:51:31,609 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:31,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 264 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:51:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-07-22 17:51:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1652. [2022-07-22 17:51:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1348 states have (on average 1.1802670623145401) internal successors, (1591), 1362 states have internal predecessors, (1591), 173 states have call successors, (173), 122 states have call predecessors, (173), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-07-22 17:51:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1967 transitions. [2022-07-22 17:51:31,768 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1967 transitions. Word has length 135 [2022-07-22 17:51:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:31,769 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 1967 transitions. [2022-07-22 17:51:31,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1967 transitions. [2022-07-22 17:51:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 17:51:31,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:31,772 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:31,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:31,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 25577228, now seen corresponding path program 1 times [2022-07-22 17:51:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795463563] [2022-07-22 17:51:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:51:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 17:51:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:32,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795463563] [2022-07-22 17:51:32,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795463563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:32,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579033395] [2022-07-22 17:51:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:32,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:32,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:32,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:51:32,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 17:51:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 17:51:32,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-22 17:51:32,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:32,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579033395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:32,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:32,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 17:51:32,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413131872] [2022-07-22 17:51:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:32,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:51:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:51:32,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:51:32,207 INFO L87 Difference]: Start difference. First operand 1652 states and 1967 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:32,327 INFO L93 Difference]: Finished difference Result 2779 states and 3331 transitions. [2022-07-22 17:51:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:51:32,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-22 17:51:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:32,332 INFO L225 Difference]: With dead ends: 2779 [2022-07-22 17:51:32,333 INFO L226 Difference]: Without dead ends: 1137 [2022-07-22 17:51:32,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:51:32,338 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 48 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:32,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 537 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:51:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-07-22 17:51:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1101. [2022-07-22 17:51:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 904 states have (on average 1.1537610619469028) internal successors, (1043), 914 states have internal predecessors, (1043), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-22 17:51:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1274 transitions. [2022-07-22 17:51:32,431 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1274 transitions. Word has length 135 [2022-07-22 17:51:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:32,431 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1274 transitions. [2022-07-22 17:51:32,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1274 transitions. [2022-07-22 17:51:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 17:51:32,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:32,435 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:32,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 17:51:32,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 537608328, now seen corresponding path program 1 times [2022-07-22 17:51:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:32,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280789656] [2022-07-22 17:51:32,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:51:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 17:51:32,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:32,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280789656] [2022-07-22 17:51:32,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280789656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:32,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454725149] [2022-07-22 17:51:32,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:32,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:32,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:32,742 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:51:32,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 17:51:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:32,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 17:51:32,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 17:51:32,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:51:32,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454725149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:32,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:51:32,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 17:51:32,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985134133] [2022-07-22 17:51:32,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:32,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:51:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:32,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:51:32,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:51:32,852 INFO L87 Difference]: Start difference. First operand 1101 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:32,949 INFO L93 Difference]: Finished difference Result 2220 states and 2613 transitions. [2022-07-22 17:51:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:51:32,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-07-22 17:51:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:32,954 INFO L225 Difference]: With dead ends: 2220 [2022-07-22 17:51:32,954 INFO L226 Difference]: Without dead ends: 1129 [2022-07-22 17:51:32,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:51:32,957 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 10 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:32,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 523 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:51:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-07-22 17:51:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1113. [2022-07-22 17:51:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 916 states have (on average 1.1288209606986899) internal successors, (1034), 926 states have internal predecessors, (1034), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-07-22 17:51:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1265 transitions. [2022-07-22 17:51:33,057 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1265 transitions. Word has length 135 [2022-07-22 17:51:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:33,057 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1265 transitions. [2022-07-22 17:51:33,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 17:51:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1265 transitions. [2022-07-22 17:51:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 17:51:33,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:33,060 INFO L195 NwaCegarLoop]: 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] [2022-07-22 17:51:33,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 17:51:33,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 17:51:33,285 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash -219686780, now seen corresponding path program 1 times [2022-07-22 17:51:33,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:33,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378143435] [2022-07-22 17:51:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:33,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:51:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 17:51:33,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:33,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378143435] [2022-07-22 17:51:33,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378143435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:33,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:51:33,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:51:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259857600] [2022-07-22 17:51:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:33,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:51:33,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:51:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:51:33,371 INFO L87 Difference]: Start difference. First operand 1113 states and 1265 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-22 17:51:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:33,910 INFO L93 Difference]: Finished difference Result 2070 states and 2337 transitions. [2022-07-22 17:51:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 17:51:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 135 [2022-07-22 17:51:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:33,919 INFO L225 Difference]: With dead ends: 2070 [2022-07-22 17:51:33,919 INFO L226 Difference]: Without dead ends: 2068 [2022-07-22 17:51:33,920 INFO L412 NwaCegarLoop]: 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 [2022-07-22 17:51:33,921 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 470 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:33,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 474 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:51:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-07-22 17:51:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1489. [2022-07-22 17:51:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1226 states have (on average 1.1305057096247961) internal successors, (1386), 1240 states have internal predecessors, (1386), 144 states have call successors, (144), 103 states have call predecessors, (144), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-07-22 17:51:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1693 transitions. [2022-07-22 17:51:34,037 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1693 transitions. Word has length 135 [2022-07-22 17:51:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:34,037 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1693 transitions. [2022-07-22 17:51:34,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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) [2022-07-22 17:51:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1693 transitions. [2022-07-22 17:51:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-22 17:51:34,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:34,041 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2022-07-22 17:51:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 17:51:34,042 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1479334343, now seen corresponding path program 2 times [2022-07-22 17:51:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:34,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213330145] [2022-07-22 17:51:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:51:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 17:51:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:51:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:51:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:51:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:51:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:51:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:51:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:51:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-22 17:51:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 17:51:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 17:51:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-22 17:51:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213330145] [2022-07-22 17:51:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213330145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:51:34,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:51:34,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:51:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260607486] [2022-07-22 17:51:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:51:34,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:51:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:34,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:51:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:51:34,111 INFO L87 Difference]: Start difference. First operand 1489 states and 1693 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 17:51:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:34,715 INFO L93 Difference]: Finished difference Result 3212 states and 3666 transitions. [2022-07-22 17:51:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 17:51:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 174 [2022-07-22 17:51:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:34,717 INFO L225 Difference]: With dead ends: 3212 [2022-07-22 17:51:34,717 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 17:51:34,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-22 17:51:34,723 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 582 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:34,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 418 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:51:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 17:51:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 17:51:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 17:51:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 17:51:34,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2022-07-22 17:51:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:34,725 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 17:51:34,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 17:51:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 17:51:34,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 17:51:34,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 17:51:34,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 17:51:34,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 17:51:47,782 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2022-07-22 17:51:47,783 INFO L895 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse20 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse22 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse23 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse24 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse26 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse27 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse21 (<= |activate_threads_~tmp~1#1| 0)) (.cse28 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse9 (and .cse25 .cse26 .cse18 (<= 2 ~m_st~0) .cse27 .cse21 .cse28)) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse14 (not (< ~local~0 ~token~0))) (.cse16 (not (<= ~token~0 (+ ~local~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse15 (not (<= 1 ~m_pc~0))) (.cse6 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse21 .cse28)) (.cse0 (not (<= 2 ~T1_E~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse13 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21 .cse22 .cse28 .cse23 .cse24)) (.cse5 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse2 .cse9 .cse10) (or .cse8 .cse0 .cse11 .cse2 .cse4 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse14 .cse15 .cse12 .cse13 .cse10 .cse16) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and (= ~m_st~0 0) .cse20 .cse22 (not (= ~t1_st~0 0)) .cse23 .cse24) .cse8 .cse0 .cse1 .cse3 .cse14 .cse15 .cse10 .cse16) (or .cse8 .cse0 .cse11 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (or .cse0 .cse11 .cse2 .cse4 .cse13 .cse5 .cse7)))) [2022-07-22 17:51:47,783 INFO L899 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2022-07-22 17:51:47,783 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2022-07-22 17:51:47,783 INFO L899 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2022-07-22 17:51:47,784 INFO L895 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse14 (= ~E_1~0 0)) (.cse11 (not (= ~token~0 ~local~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse5 (and .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse10 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse13 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse7 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse1 .cse7 .cse8 .cse4 .cse12 .cse5 .cse10 .cse9 .cse6 .cse13) (or .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse14 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse11) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse14 .cse11) (or .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse6) (or .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (or .cse0 .cse1 (and .cse15 .cse16) .cse7 .cse8 .cse12 .cse10 .cse6 .cse13)))) [2022-07-22 17:51:47,784 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2022-07-22 17:51:47,784 INFO L899 garLoopResultBuilder]: For program point L327-2(lines 311 335) no Hoare annotation was computed. [2022-07-22 17:51:47,784 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2022-07-22 17:51:47,784 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2022-07-22 17:51:47,784 INFO L899 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2022-07-22 17:51:47,785 INFO L895 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse22 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse23 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse24 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse25 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse20 (<= |activate_threads_~tmp~1#1| 0)) (.cse26 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse16 (and .cse23 .cse24 .cse18 (<= 2 ~m_st~0) .cse25 .cse20 .cse26)) (.cse5 (not (< ~local~0 ~token~0))) (.cse9 (not (<= ~token~0 (+ ~local~0 1)))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse21 .cse26 .cse22)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 1 ~m_pc~0))) (.cse11 (= ~E_1~0 0)) (.cse12 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26)) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse1 .cse15 .cse4 .cse6 .cse8 .cse13) (or .cse14 .cse1 .cse2 .cse10 .cse16 .cse8) (or .cse14 .cse1 .cse15 .cse10 .cse4 .cse16 .cse8) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse14 .cse1 .cse2 .cse3 .cse5 .cse6 (and (= ~m_st~0 0) .cse21 (not (= ~t1_st~0 0)) .cse22) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse15 .cse10 .cse4 .cse11 .cse13) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8) (or .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse8 .cse13) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12 .cse13)))) [2022-07-22 17:51:47,785 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2022-07-22 17:51:47,785 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 311 335) the Hoare annotation is: (let ((.cse13 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse11 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse8 (not (= ~t1_pc~0 1))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse5 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse8 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse10 .cse6) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse13 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse6) (or .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse12 .cse5 .cse6 .cse14))) [2022-07-22 17:51:47,785 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 311 335) no Hoare annotation was computed. [2022-07-22 17:51:47,786 INFO L895 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse4 (= ~E_1~0 0)) (.cse5 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse13 (not (< ~local~0 ~token~0))) (.cse12 (not (<= 1 ~m_pc~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1)))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse6 (and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0) .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse9 .cse10 .cse6) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse13 .cse12 .cse9 .cse10 .cse14 .cse6) (or .cse11 .cse0 .cse7 .cse8 .cse3 .cse12 .cse10 .cse6) (or .cse11 .cse0 .cse7 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse12 .cse4 .cse5 .cse6) (or .cse11 .cse0 .cse7 .cse2 .cse10 .cse6) (or .cse11 .cse0 (and .cse15 .cse16) .cse7 .cse8 .cse13 .cse12 .cse10 .cse14) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6)))) [2022-07-22 17:51:47,786 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 336 346) no Hoare annotation was computed. [2022-07-22 17:51:47,786 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 336 346) the Hoare annotation is: (let ((.cse4 (not (= ~m_pc~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse9 (= ~E_1~0 0)) (.cse10 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse8 (not (<= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10) (or .cse1 .cse2 (not (<= ~t1_pc~0 0)) .cse4 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (< ~local~0 ~token~0)) .cse8 .cse5 (not (<= ~token~0 (+ ~local~0 1)))))) [2022-07-22 17:51:47,786 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 336 346) no Hoare annotation was computed. [2022-07-22 17:51:47,786 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2022-07-22 17:51:47,786 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 184 203) no Hoare annotation was computed. [2022-07-22 17:51:47,787 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2022-07-22 17:51:47,787 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 184 203) the Hoare annotation is: true [2022-07-22 17:51:47,787 INFO L902 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: true [2022-07-22 17:51:47,787 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 184 203) no Hoare annotation was computed. [2022-07-22 17:51:47,787 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 255 282) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-07-22 17:51:47,787 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 255 282) no Hoare annotation was computed. [2022-07-22 17:51:47,787 INFO L899 garLoopResultBuilder]: For program point L274-1(lines 255 282) no Hoare annotation was computed. [2022-07-22 17:51:47,788 INFO L899 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2022-07-22 17:51:47,788 INFO L899 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2022-07-22 17:51:47,788 INFO L899 garLoopResultBuilder]: For program point L259-1(lines 258 281) no Hoare annotation was computed. [2022-07-22 17:51:47,788 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 158 165) no Hoare annotation was computed. [2022-07-22 17:51:47,788 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 158 165) the Hoare annotation is: true [2022-07-22 17:51:47,788 INFO L899 garLoopResultBuilder]: For program point L287-1(lines 286 309) no Hoare annotation was computed. [2022-07-22 17:51:47,789 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 283 310) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-07-22 17:51:47,789 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 283 310) no Hoare annotation was computed. [2022-07-22 17:51:47,789 INFO L899 garLoopResultBuilder]: For program point L302-1(lines 283 310) no Hoare annotation was computed. [2022-07-22 17:51:47,789 INFO L899 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2022-07-22 17:51:47,789 INFO L899 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2022-07-22 17:51:47,789 INFO L902 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: true [2022-07-22 17:51:47,789 INFO L895 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,790 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 (= ~token~0 ~local~0)) (and .cse4 .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse5) (and .cse4 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-07-22 17:51:47,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 17:51:47,790 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-07-22 17:51:47,790 INFO L902 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2022-07-22 17:51:47,790 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,790 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-07-22 17:51:47,791 INFO L895 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2022-07-22 17:51:47,791 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2022-07-22 17:51:47,791 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2022-07-22 17:51:47,791 INFO L895 garLoopResultBuilder]: At program point L451(line 451) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,791 INFO L899 garLoopResultBuilder]: For program point L451-1(line 451) no Hoare annotation was computed. [2022-07-22 17:51:47,791 INFO L899 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2022-07-22 17:51:47,792 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2022-07-22 17:51:47,792 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-07-22 17:51:47,792 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-07-22 17:51:47,792 INFO L895 garLoopResultBuilder]: At program point L353(lines 347 355) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,792 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-07-22 17:51:47,792 INFO L895 garLoopResultBuilder]: At program point L436(line 436) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,793 INFO L899 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2022-07-22 17:51:47,793 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2022-07-22 17:51:47,793 INFO L895 garLoopResultBuilder]: At program point L421(line 421) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-22 17:51:47,793 INFO L899 garLoopResultBuilder]: For program point L421-1(line 421) no Hoare annotation was computed. [2022-07-22 17:51:47,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 17:51:47,793 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2022-07-22 17:51:47,793 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-07-22 17:51:47,794 INFO L895 garLoopResultBuilder]: At program point L92(lines 87 118) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~m_pc~0) .cse4 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2022-07-22 17:51:47,794 INFO L895 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-22 17:51:47,794 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (<= 1 ~m_pc~0) .cse3 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0)))) [2022-07-22 17:51:47,794 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2022-07-22 17:51:47,794 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-22 17:51:47,794 INFO L895 garLoopResultBuilder]: At program point L423-1(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-22 17:51:47,795 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,795 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,795 INFO L895 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~token~0 ~local~0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 .cse5))) [2022-07-22 17:51:47,795 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2022-07-22 17:51:47,795 INFO L895 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-07-22 17:51:47,795 INFO L895 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-07-22 17:51:47,796 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse5 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ~m_pc~0 0)) (.cse6 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse3 .cse5 .cse6) (and .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 .cse4 .cse6))) [2022-07-22 17:51:47,796 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 17:51:47,796 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2022-07-22 17:51:47,796 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,796 INFO L895 garLoopResultBuilder]: At program point L375-1(lines 356 383) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,797 INFO L895 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,797 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,797 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,797 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-07-22 17:51:47,797 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2022-07-22 17:51:47,797 INFO L895 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,798 INFO L895 garLoopResultBuilder]: At program point L113(lines 84 119) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~m_st~0)) (.cse7 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse6 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse4 .cse6 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse7 .cse4 .cse6))) [2022-07-22 17:51:47,798 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-07-22 17:51:47,798 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2022-07-22 17:51:47,798 INFO L899 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2022-07-22 17:51:47,798 INFO L895 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (<= 1 ~m_pc~0) (<= 2 ~T1_E~0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2022-07-22 17:51:47,798 INFO L895 garLoopResultBuilder]: At program point L428-1(lines 425 465) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,799 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 17:51:47,799 INFO L899 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2022-07-22 17:51:47,799 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-07-22 17:51:47,799 INFO L899 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-07-22 17:51:47,799 INFO L895 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse2 (<= 2 ~m_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse7 (= ~m_st~0 0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 (< ~local~0 ~token~0)))) [2022-07-22 17:51:47,799 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-07-22 17:51:47,800 INFO L899 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2022-07-22 17:51:47,800 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-07-22 17:51:47,800 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2022-07-22 17:51:47,800 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2022-07-22 17:51:47,800 INFO L895 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-07-22 17:51:47,800 INFO L899 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2022-07-22 17:51:47,803 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:47,805 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 17:51:47,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 05:51:47 BoogieIcfgContainer [2022-07-22 17:51:47,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 17:51:47,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 17:51:47,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 17:51:47,854 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 17:51:47,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:51:22" (3/4) ... [2022-07-22 17:51:47,856 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 17:51:47,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-07-22 17:51:47,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-07-22 17:51:47,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-07-22 17:51:47,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-07-22 17:51:47,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-07-22 17:51:47,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-07-22 17:51:47,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-22 17:51:47,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 17:51:47,874 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 17:51:47,874 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 17:51:47,897 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) [2022-07-22 17:51:47,897 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) [2022-07-22 17:51:47,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) [2022-07-22 17:51:47,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) [2022-07-22 17:51:47,937 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 17:51:47,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 17:51:47,939 INFO L158 Benchmark]: Toolchain (without parser) took 26579.42ms. Allocated memory was 92.3MB in the beginning and 702.5MB in the end (delta: 610.3MB). Free memory was 59.2MB in the beginning and 545.3MB in the end (delta: -486.1MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. [2022-07-22 17:51:47,939 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:51:47,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.76ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 59.1MB in the beginning and 89.1MB in the end (delta: -30.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 17:51:47,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.01ms. Allocated memory is still 115.3MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 17:51:47,940 INFO L158 Benchmark]: Boogie Preprocessor took 49.19ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 85.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 17:51:47,940 INFO L158 Benchmark]: RCFGBuilder took 345.22ms. Allocated memory is still 115.3MB. Free memory was 85.5MB in the beginning and 70.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 17:51:47,941 INFO L158 Benchmark]: TraceAbstraction took 25788.01ms. Allocated memory was 115.3MB in the beginning and 702.5MB in the end (delta: 587.2MB). Free memory was 69.8MB in the beginning and 550.7MB in the end (delta: -480.9MB). Peak memory consumption was 447.4MB. Max. memory is 16.1GB. [2022-07-22 17:51:47,941 INFO L158 Benchmark]: Witness Printer took 84.48ms. Allocated memory is still 702.5MB. Free memory was 550.7MB in the beginning and 545.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 17:51:47,946 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.76ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 59.1MB in the beginning and 89.1MB in the end (delta: -30.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.01ms. Allocated memory is still 115.3MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.19ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 85.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.22ms. Allocated memory is still 115.3MB. Free memory was 85.5MB in the beginning and 70.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25788.01ms. Allocated memory was 115.3MB in the beginning and 702.5MB in the end (delta: 587.2MB). Free memory was 69.8MB in the beginning and 550.7MB in the end (delta: -480.9MB). Peak memory consumption was 447.4MB. Max. memory is 16.1GB. * Witness Printer took 84.48ms. Allocated memory is still 702.5MB. Free memory was 550.7MB in the beginning and 545.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3539 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3427 mSDsluCounter, 6603 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3794 mSDsCounter, 653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3424 IncrementalHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 653 mSolverCounterUnsat, 2809 mSDtfsCounter, 3424 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1451 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3350occurred in iteration=8, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 2416 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 5313 PreInvPairs, 6028 NumberOfFragments, 6978 HoareAnnotationTreeSize, 5313 FomulaSimplifications, 13474 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 43 FomulaSimplificationsInter, 159673 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2887 NumberOfCodeBlocks, 2887 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 4660 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3527 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1398/1568 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && 2 <= m_st) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((2 <= E_1 && 2 <= E_M) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0))) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) || ((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || (((((2 <= E_1 && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2 RESULT: Ultimate proved your program to be correct! [2022-07-22 17:51:47,995 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